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/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:40:44,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:40:44,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:40:44,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:40:44,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:40:44,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:40:44,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:40:44,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:40:44,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:40:44,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:40:44,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:40:44,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:40:44,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:40:44,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:40:44,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:40:44,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:40:44,241 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:40:44,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:40:44,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:40:44,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:40:44,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:40:44,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:40:44,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:40:44,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:40:44,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:40:44,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:40:44,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:40:44,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:40:44,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:40:44,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:40:44,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:40:44,252 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-13 03:40:44,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:40:44,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:40:44,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:40:44,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:40:44,264 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:40:44,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:40:44,264 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:40:44,264 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:40:44,265 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:40:44,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:40:44,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:40:44,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:40:44,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:40:44,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:40:44,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:40:44,267 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 03:40:44,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 03:40:44,267 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 03:40:44,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:40:44,307 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:40:44,311 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:40:44,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:40:44,312 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:40:44,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,591 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf694f56e8 [2018-04-13 03:40:44,729 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:40:44,729 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:40:44,729 INFO L168 CDTParser]: Scanning cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,738 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:40:44,738 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:40:44,738 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:40:44,738 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,738 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:40:44,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uint in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:44,763 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf694f56e8 [2018-04-13 03:40:44,767 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:40:44,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:40:44,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:40:44,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:40:44,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:40:44,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:40:44" (1/1) ... [2018-04-13 03:40:44,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8d620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:44, skipping insertion in model container [2018-04-13 03:40:44,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:40:44" (1/1) ... [2018-04-13 03:40:44,787 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:40:44,809 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:40:44,939 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:40:44,974 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:40:44,980 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 03:40:45,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45 WrapperNode [2018-04-13 03:40:45,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:40:45,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:40:45,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:40:45,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:40:45,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... [2018-04-13 03:40:45,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:40:45,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:40:45,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:40:45,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:40:45,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:40:45,142 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:40:45,142 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:40:45,142 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:40:45,142 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:40:45,142 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-04-13 03:40:45,142 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:40:45,142 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:40:45,143 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:40:45,144 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:40:45,145 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:40:45,146 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:40:45,147 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:40:45,148 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:40:45,149 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:40:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:40:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:40:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:40:45,423 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:40:45,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:40:45 BoogieIcfgContainer [2018-04-13 03:40:45,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:40:45,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:40:45,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:40:45,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:40:45,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:40:44" (1/3) ... [2018-04-13 03:40:45,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d3df1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:40:45, skipping insertion in model container [2018-04-13 03:40:45,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:45" (2/3) ... [2018-04-13 03:40:45,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d3df1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:40:45, skipping insertion in model container [2018-04-13 03:40:45,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:40:45" (3/3) ... [2018-04-13 03:40:45,428 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:45,436 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:40:45,442 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-13 03:40:45,470 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:40:45,471 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:40:45,471 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:40:45,471 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 03:40:45,471 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 03:40:45,471 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:40:45,471 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:40:45,471 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:40:45,471 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:40:45,472 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:40:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-04-13 03:40:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 03:40:45,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:45,487 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:45,487 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash -58907273, now seen corresponding path program 1 times [2018-04-13 03:40:45,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:45,491 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:45,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:45,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:45,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:45,560 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:45,618 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-13 03:40:45,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:45,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:45,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:40:45,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:40:45,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:40:45,634 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-04-13 03:40:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:45,765 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-04-13 03:40:45,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:40:45,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-13 03:40:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:45,773 INFO L225 Difference]: With dead ends: 91 [2018-04-13 03:40:45,773 INFO L226 Difference]: Without dead ends: 86 [2018-04-13 03:40:45,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:40:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-13 03:40:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 49. [2018-04-13 03:40:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 03:40:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-04-13 03:40:45,806 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 11 [2018-04-13 03:40:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:45,806 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-04-13 03:40:45,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:40:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-04-13 03:40:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 03:40:45,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:45,807 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:45,807 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -58905351, now seen corresponding path program 1 times [2018-04-13 03:40:45,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:45,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:45,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:45,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:45,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:45,818 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:45,827 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-13 03:40:45,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:45,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 03:40:45,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 03:40:45,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 03:40:45,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:40:45,829 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 3 states. [2018-04-13 03:40:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:45,852 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-04-13 03:40:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 03:40:45,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-13 03:40:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:45,853 INFO L225 Difference]: With dead ends: 50 [2018-04-13 03:40:45,853 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 03:40:45,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:40:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 03:40:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-04-13 03:40:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 03:40:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-04-13 03:40:45,856 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 11 [2018-04-13 03:40:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:45,856 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-04-13 03:40:45,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 03:40:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-04-13 03:40:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 03:40:45,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:45,857 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:45,857 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2034104824, now seen corresponding path program 1 times [2018-04-13 03:40:45,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:45,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:45,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:45,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:45,873 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:45,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:45,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:45,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:45,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:45,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:45,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:45,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:40:45,935 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-13 03:40:45,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,938 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-13 03:40:45,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:45,943 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-13 03:40:45,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:45,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:40:45,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:40:45,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:40:45,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:40:45,945 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-04-13 03:40:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,004 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-04-13 03:40:46,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:40:46,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-13 03:40:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,005 INFO L225 Difference]: With dead ends: 45 [2018-04-13 03:40:46,005 INFO L226 Difference]: Without dead ends: 45 [2018-04-13 03:40:46,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:40:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-13 03:40:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-04-13 03:40:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 03:40:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-04-13 03:40:46,009 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-04-13 03:40:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,009 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-04-13 03:40:46,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:40:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-04-13 03:40:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 03:40:46,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,010 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,010 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2034104823, now seen corresponding path program 1 times [2018-04-13 03:40:46,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,025 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,028 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:46,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:46,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:46,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:46,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:46,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:40:46,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:46,107 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-13 03:40:46,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:46,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:46,122 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-13 03:40:46,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,128 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-13 03:40:46,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:40:46,136 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-13 03:40:46,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:46,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:46,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:46,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:46,137 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-04-13 03:40:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,225 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-04-13 03:40:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:40:46,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-13 03:40:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,226 INFO L225 Difference]: With dead ends: 64 [2018-04-13 03:40:46,226 INFO L226 Difference]: Without dead ends: 64 [2018-04-13 03:40:46,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:40:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-13 03:40:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-04-13 03:40:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 03:40:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-04-13 03:40:46,231 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 15 [2018-04-13 03:40:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,231 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-04-13 03:40:46,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-04-13 03:40:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 03:40:46,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,232 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,232 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1354046453, now seen corresponding path program 1 times [2018-04-13 03:40:46,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,232 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,235 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,235 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,245 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,247 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:46,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:46,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:46,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:46,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:46,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:46,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:40:46,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:46,308 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-13 03:40:46,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:46,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:46,319 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-13 03:40:46,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,325 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-13 03:40:46,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:40:46,332 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-13 03:40:46,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:46,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:46,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:46,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:46,332 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-04-13 03:40:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,386 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-04-13 03:40:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:40:46,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-13 03:40:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,387 INFO L225 Difference]: With dead ends: 52 [2018-04-13 03:40:46,387 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 03:40:46,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:40:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 03:40:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-04-13 03:40:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-13 03:40:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-04-13 03:40:46,389 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15 [2018-04-13 03:40:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,390 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-04-13 03:40:46,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-04-13 03:40:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:40:46,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,390 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,390 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1367259900, now seen corresponding path program 1 times [2018-04-13 03:40:46,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,390 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,399 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,415 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-13 03:40:46,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:40:46,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:40:46,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:40:46,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:40:46,416 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-04-13 03:40:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,451 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-04-13 03:40:46,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:40:46,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 03:40:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,451 INFO L225 Difference]: With dead ends: 43 [2018-04-13 03:40:46,451 INFO L226 Difference]: Without dead ends: 43 [2018-04-13 03:40:46,452 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-13 03:40:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-13 03:40:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-13 03:40:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-13 03:40:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-04-13 03:40:46,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-04-13 03:40:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,454 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-04-13 03:40:46,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:40:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-04-13 03:40:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:40:46,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,454 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,454 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1367259901, now seen corresponding path program 1 times [2018-04-13 03:40:46,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,455 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,461 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,503 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-13 03:40:46,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:46,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:46,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:46,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:46,504 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-04-13 03:40:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,576 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-04-13 03:40:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:40:46,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-13 03:40:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,577 INFO L225 Difference]: With dead ends: 58 [2018-04-13 03:40:46,577 INFO L226 Difference]: Without dead ends: 58 [2018-04-13 03:40:46,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:40:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-13 03:40:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-04-13 03:40:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 03:40:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-13 03:40:46,579 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-04-13 03:40:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,580 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-13 03:40:46,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-13 03:40:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:40:46,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,580 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,580 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,580 INFO L82 PathProgramCache]: Analyzing trace with hash 557913275, now seen corresponding path program 1 times [2018-04-13 03:40:46,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,580 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,586 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,614 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-13 03:40:46,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:46,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:46,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:46,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:46,615 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-04-13 03:40:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,653 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-13 03:40:46,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:40:46,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-13 03:40:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,654 INFO L225 Difference]: With dead ends: 49 [2018-04-13 03:40:46,654 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 03:40:46,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:40:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 03:40:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-04-13 03:40:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-13 03:40:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-04-13 03:40:46,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16 [2018-04-13 03:40:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,656 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-04-13 03:40:46,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-04-13 03:40:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 03:40:46,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,657 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,657 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1383367435, now seen corresponding path program 1 times [2018-04-13 03:40:46,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,663 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,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-13 03:40:46,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:40:46,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:40:46,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:40:46,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:40:46,689 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-04-13 03:40:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,720 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-04-13 03:40:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:40:46,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-13 03:40:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,720 INFO L225 Difference]: With dead ends: 41 [2018-04-13 03:40:46,721 INFO L226 Difference]: Without dead ends: 41 [2018-04-13 03:40:46,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-13 03:40:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-04-13 03:40:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-13 03:40:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-04-13 03:40:46,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-04-13 03:40:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,723 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-04-13 03:40:46,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:40:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-04-13 03:40:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 03:40:46,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,724 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,724 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1383367434, now seen corresponding path program 1 times [2018-04-13 03:40:46,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,724 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,732 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,770 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-13 03:40:46,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:46,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 03:40:46,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 03:40:46,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 03:40:46,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:40:46,771 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-04-13 03:40:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:46,842 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-04-13 03:40:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:40:46,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-13 03:40:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:46,843 INFO L225 Difference]: With dead ends: 46 [2018-04-13 03:40:46,843 INFO L226 Difference]: Without dead ends: 46 [2018-04-13 03:40:46,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:40:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-13 03:40:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-04-13 03:40:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-13 03:40:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-04-13 03:40:46,846 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2018-04-13 03:40:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:46,846 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-04-13 03:40:46,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 03:40:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-04-13 03:40:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:40:46,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:46,847 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:46,847 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1688021460, now seen corresponding path program 1 times [2018-04-13 03:40:46,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:46,848 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:46,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,856 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:46,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:46,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:46,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:46,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:46,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-13 03:40:46,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:46,938 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-13 03:40:46,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 03:40:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:46,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:46,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-04-13 03:40:46,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:40:46,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:40:46,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:40:46,980 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-04-13 03:40:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:47,114 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-04-13 03:40:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:40:47,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-04-13 03:40:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:47,115 INFO L225 Difference]: With dead ends: 61 [2018-04-13 03:40:47,115 INFO L226 Difference]: Without dead ends: 61 [2018-04-13 03:40:47,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:40:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-13 03:40:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-04-13 03:40:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 03:40:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-04-13 03:40:47,118 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 23 [2018-04-13 03:40:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:47,118 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-04-13 03:40:47,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:40:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-04-13 03:40:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 03:40:47,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:47,119 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-13 03:40:47,119 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash -789102402, now seen corresponding path program 1 times [2018-04-13 03:40:47,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:47,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:47,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:47,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:47,127 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:47,153 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-13 03:40:47,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:47,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:47,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:47,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:47,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:47,154 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 6 states. [2018-04-13 03:40:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:47,215 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-04-13 03:40:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:40:47,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-13 03:40:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:47,219 INFO L225 Difference]: With dead ends: 45 [2018-04-13 03:40:47,219 INFO L226 Difference]: Without dead ends: 45 [2018-04-13 03:40:47,220 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-13 03:40:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-13 03:40:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-04-13 03:40:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 03:40:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-04-13 03:40:47,222 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2018-04-13 03:40:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:47,222 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-04-13 03:40:47,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-04-13 03:40:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 03:40:47,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:47,223 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-13 03:40:47,223 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash -789102401, now seen corresponding path program 1 times [2018-04-13 03:40:47,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:47,224 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:47,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:47,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:47,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:47,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-13 03:40:47,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:47,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:40:47,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:40:47,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:40:47,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:40:47,287 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 9 states. [2018-04-13 03:40:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:47,406 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-04-13 03:40:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 03:40:47,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-13 03:40:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:47,407 INFO L225 Difference]: With dead ends: 52 [2018-04-13 03:40:47,407 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 03:40:47,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:40:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 03:40:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-04-13 03:40:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-13 03:40:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-13 03:40:47,410 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2018-04-13 03:40:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:47,410 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-13 03:40:47,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:40:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-13 03:40:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 03:40:47,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:47,411 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:47,411 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1307629356, now seen corresponding path program 1 times [2018-04-13 03:40:47,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:47,412 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:47,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:47,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:47,420 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:47,445 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-13 03:40:47,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:47,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:47,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:47,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:47,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:47,446 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 6 states. [2018-04-13 03:40:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:47,499 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-13 03:40:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:40:47,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-13 03:40:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:47,500 INFO L225 Difference]: With dead ends: 47 [2018-04-13 03:40:47,500 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 03:40:47,501 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-13 03:40:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 03:40:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 03:40:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 03:40:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-13 03:40:47,503 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 25 [2018-04-13 03:40:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:47,503 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-13 03:40:47,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-13 03:40:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 03:40:47,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:47,504 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:47,504 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1307629357, now seen corresponding path program 1 times [2018-04-13 03:40:47,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:47,504 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:47,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:47,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:47,512 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:47,561 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-13 03:40:47,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:47,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:40:47,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:40:47,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:40:47,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:40:47,563 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 8 states. [2018-04-13 03:40:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:47,675 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-04-13 03:40:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:40:47,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-13 03:40:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:47,676 INFO L225 Difference]: With dead ends: 52 [2018-04-13 03:40:47,676 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 03:40:47,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:40:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 03:40:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-04-13 03:40:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 03:40:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-13 03:40:47,679 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25 [2018-04-13 03:40:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:47,679 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-13 03:40:47,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:40:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-13 03:40:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:40:47,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:47,680 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:47,680 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1924753718, now seen corresponding path program 2 times [2018-04-13 03:40:47,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:47,680 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:47,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:47,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:47,689 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 03:40:47,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:47,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 03:40:47,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:40:47,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:40:47,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:40:47,762 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2018-04-13 03:40:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:47,830 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-04-13 03:40:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 03:40:47,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-13 03:40:47,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:47,831 INFO L225 Difference]: With dead ends: 74 [2018-04-13 03:40:47,831 INFO L226 Difference]: Without dead ends: 74 [2018-04-13 03:40:47,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:40:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-13 03:40:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2018-04-13 03:40:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 03:40:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-04-13 03:40:47,834 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 26 [2018-04-13 03:40:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:47,834 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-04-13 03:40:47,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:40:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-04-13 03:40:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:40:47,835 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:47,835 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:47,835 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -69390988, now seen corresponding path program 1 times [2018-04-13 03:40:47,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:47,835 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:47,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:47,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:47,844 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 03:40:47,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:47,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 03:40:47,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 03:40:47,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 03:40:47,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:40:47,931 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states. [2018-04-13 03:40:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:48,143 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-04-13 03:40:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:40:48,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-04-13 03:40:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:48,144 INFO L225 Difference]: With dead ends: 102 [2018-04-13 03:40:48,144 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 03:40:48,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:40:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 03:40:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2018-04-13 03:40:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 03:40:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-04-13 03:40:48,148 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26 [2018-04-13 03:40:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:48,148 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-04-13 03:40:48,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 03:40:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-04-13 03:40:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:40:48,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:48,149 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:48,149 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1758334730, now seen corresponding path program 1 times [2018-04-13 03:40:48,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:48,149 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:48,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:48,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:48,160 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:48,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:48,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:48,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:48,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:48,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:48,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:48,331 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-13 03:40:48,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 03:40:48,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:48,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:48,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:48,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:48,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:48,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:40:48,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-13 03:40:48,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:48,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:48,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:48,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:48,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:49 [2018-04-13 03:40:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:48,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:48,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-04-13 03:40:48,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:40:48,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:40:48,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:40:48,566 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 22 states. [2018-04-13 03:40:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:49,182 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-04-13 03:40:49,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:40:49,182 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-04-13 03:40:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:49,183 INFO L225 Difference]: With dead ends: 83 [2018-04-13 03:40:49,183 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 03:40:49,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:40:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 03:40:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-04-13 03:40:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 03:40:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-04-13 03:40:49,185 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-04-13 03:40:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:49,186 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-04-13 03:40:49,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:40:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-04-13 03:40:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 03:40:49,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:49,186 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:49,186 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:49,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1838913673, now seen corresponding path program 1 times [2018-04-13 03:40:49,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:49,187 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:49,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:49,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:49,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:49,194 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:49,248 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-13 03:40:49,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:49,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:49,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:49,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:49,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:49,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,278 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-13 03:40:49,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 03:40:49,291 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-13 03:40:49,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:40:49,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2018-04-13 03:40:49,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 03:40:49,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 03:40:49,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:40:49,292 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 10 states. [2018-04-13 03:40:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:49,361 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-04-13 03:40:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 03:40:49,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-04-13 03:40:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:49,362 INFO L225 Difference]: With dead ends: 77 [2018-04-13 03:40:49,362 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 03:40:49,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:40:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 03:40:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-04-13 03:40:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-13 03:40:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-04-13 03:40:49,364 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 28 [2018-04-13 03:40:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:49,364 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-04-13 03:40:49,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 03:40:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-04-13 03:40:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:40:49,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:49,365 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:49,365 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1372572863, now seen corresponding path program 1 times [2018-04-13 03:40:49,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:49,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:49,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:49,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:49,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:49,372 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:49,375 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:49,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:49,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:49,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:49,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:49,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:49,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:49,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-13 03:40:49,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-04-13 03:40:49,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-13 03:40:49,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:49,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-04-13 03:40:49,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-13 03:40:49,642 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:40:49,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 03:40:49,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,655 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-13 03:40:49,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2018-04-13 03:40:49,666 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-13 03:40:49,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:49,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-13 03:40:49,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:40:49,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:40:49,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:40:49,667 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 14 states. [2018-04-13 03:40:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:49,908 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-04-13 03:40:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:40:49,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-04-13 03:40:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:49,909 INFO L225 Difference]: With dead ends: 125 [2018-04-13 03:40:49,909 INFO L226 Difference]: Without dead ends: 125 [2018-04-13 03:40:49,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:40:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-13 03:40:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2018-04-13 03:40:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-13 03:40:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-04-13 03:40:49,913 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 29 [2018-04-13 03:40:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:49,913 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-04-13 03:40:49,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:40:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-04-13 03:40:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:40:49,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:49,913 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:49,914 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash -949871037, now seen corresponding path program 1 times [2018-04-13 03:40:49,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:49,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:49,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:49,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:49,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:49,922 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:49,924 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:49,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:49,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:49,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:50,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 03:40:50,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:50,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 03:40:50,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-04-13 03:40:50,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-13 03:40:50,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:50,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-13 03:40:50,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 03:40:50,188 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:40:50,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, 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 7 [2018-04-13 03:40:50,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,195 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-13 03:40:50,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-04-13 03:40:50,205 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-13 03:40:50,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:50,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-13 03:40:50,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:40:50,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:40:50,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:40:50,206 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 15 states. [2018-04-13 03:40:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:50,552 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-04-13 03:40:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:40:50,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-13 03:40:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:50,552 INFO L225 Difference]: With dead ends: 152 [2018-04-13 03:40:50,553 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 03:40:50,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:40:50,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 03:40:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 95. [2018-04-13 03:40:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-13 03:40:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-04-13 03:40:50,556 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 29 [2018-04-13 03:40:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:50,557 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-04-13 03:40:50,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:40:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-04-13 03:40:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:40:50,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:50,557 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:50,557 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash -731016319, now seen corresponding path program 1 times [2018-04-13 03:40:50,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:50,558 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:50,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:50,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:50,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:50,565 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:50,567 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:50,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:50,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:50,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:50,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:50,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:50,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:40:50,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:50,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:50,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, 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-13 03:40:50,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 03:40:50,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:50,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:50,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:50,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:40:50,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 03:40:50,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:50,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:50,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-13 03:40:50,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-13 03:40:50,777 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:40:50,777 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 14 treesize of output 10 [2018-04-13 03:40:50,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 03:40:50,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:50,794 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-13 03:40:50,806 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-13 03:40:50,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:50,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 03:40:50,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:40:50,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:40:50,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:40:50,808 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 13 states. [2018-04-13 03:40:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:51,093 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2018-04-13 03:40:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:40:51,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-13 03:40:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:51,094 INFO L225 Difference]: With dead ends: 139 [2018-04-13 03:40:51,094 INFO L226 Difference]: Without dead ends: 139 [2018-04-13 03:40:51,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:40:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-13 03:40:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2018-04-13 03:40:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-13 03:40:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-04-13 03:40:51,097 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 29 [2018-04-13 03:40:51,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:51,098 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-04-13 03:40:51,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:40:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-04-13 03:40:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:40:51,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:51,098 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:51,098 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1128799700, now seen corresponding path program 2 times [2018-04-13 03:40:51,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:51,099 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:51,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:51,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:51,107 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:51,330 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-13 03:40:51,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:51,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:40:51,345 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:40:51,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:51,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:51,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:51,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:51,390 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-13 03:40:51,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 03:40:51,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:51,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:51,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:51,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:51,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:51,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:40:51,545 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 28 treesize of output 22 [2018-04-13 03:40:51,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:51,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-13 03:40:51,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:51,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:51,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:51,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:49 [2018-04-13 03:40:51,674 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-13 03:40:51,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:51,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-04-13 03:40:51,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:40:51,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:40:51,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:40:51,675 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 28 states. [2018-04-13 03:40:52,295 WARN L151 SmtUtils]: Spent 435ms on a formula simplification. DAG size of input: 52 DAG size of output 35 [2018-04-13 03:40:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:53,187 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-04-13 03:40:53,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:40:53,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-04-13 03:40:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:53,191 INFO L225 Difference]: With dead ends: 175 [2018-04-13 03:40:53,191 INFO L226 Difference]: Without dead ends: 175 [2018-04-13 03:40:53,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:40:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-13 03:40:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2018-04-13 03:40:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 03:40:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-04-13 03:40:53,196 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 29 [2018-04-13 03:40:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:53,196 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-04-13 03:40:53,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:40:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-04-13 03:40:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 03:40:53,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:53,197 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:53,197 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1116956099, now seen corresponding path program 1 times [2018-04-13 03:40:53,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:53,197 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:53,197 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:53,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:53,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:53,204 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:53,209 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:53,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:53,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:53,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:53,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:53,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:53,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:53,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:40:53,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:53,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:53,254 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-13 03:40:53,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,261 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-13 03:40:53,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-13 03:40:53,283 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-13 03:40:53,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 13 treesize of output 12 [2018-04-13 03:40:53,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-04-13 03:40:53,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 03:40:53,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:53,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:53,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2018-04-13 03:40:53,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-13 03:40:53,386 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-13 03:40:53,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:53,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 03:40:53,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:53,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:53,404 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:54 [2018-04-13 03:40:53,462 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-13 03:40:53,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:40:53,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:40:53,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:40:53,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:40:53,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:40:53,463 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 15 states. [2018-04-13 03:40:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:53,819 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2018-04-13 03:40:53,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:40:53,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-13 03:40:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:53,821 INFO L225 Difference]: With dead ends: 136 [2018-04-13 03:40:53,821 INFO L226 Difference]: Without dead ends: 136 [2018-04-13 03:40:53,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:40:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-13 03:40:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-04-13 03:40:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 03:40:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-04-13 03:40:53,824 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 29 [2018-04-13 03:40:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:53,824 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-04-13 03:40:53,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:40:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-04-13 03:40:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 03:40:53,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:53,825 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:53,825 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 265900713, now seen corresponding path program 1 times [2018-04-13 03:40:53,825 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:53,825 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:53,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:53,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:53,831 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:53,905 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-13 03:40:53,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:53,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:53,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:53,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:53,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-13 03:40:53,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:53,932 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-13 03:40:53,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 03:40:54,017 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-13 03:40:54,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:54,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-13 03:40:54,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:40:54,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:40:54,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:40:54,019 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 17 states. [2018-04-13 03:40:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:54,201 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-04-13 03:40:54,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 03:40:54,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-04-13 03:40:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:54,202 INFO L225 Difference]: With dead ends: 164 [2018-04-13 03:40:54,202 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 03:40:54,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:40:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 03:40:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 142. [2018-04-13 03:40:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:40:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-04-13 03:40:54,204 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 30 [2018-04-13 03:40:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:54,204 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-04-13 03:40:54,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:40:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-04-13 03:40:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:40:54,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:54,205 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:54,205 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1522064694, now seen corresponding path program 3 times [2018-04-13 03:40:54,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:54,205 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:54,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:54,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:54,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:54,213 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:54,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:54,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:40:54,476 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-13 03:40:54,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:54,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:54,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:54,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:54,531 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-13 03:40:54,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 03:40:54,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:54,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:54,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:54,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:54,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:40:54,728 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-13 03:40:54,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:54,734 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-13 03:40:54,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:38 [2018-04-13 03:40:54,803 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 33 treesize of output 25 [2018-04-13 03:40:54,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 47 [2018-04-13 03:40:54,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2018-04-13 03:40:54,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:54,845 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-13 03:40:54,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:88 [2018-04-13 03:40:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:54,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:54,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-13 03:40:54,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 03:40:54,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 03:40:54,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:40:54,967 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 32 states. [2018-04-13 03:40:55,757 WARN L151 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 55 DAG size of output 38 [2018-04-13 03:40:56,526 WARN L151 SmtUtils]: Spent 713ms on a formula simplification. DAG size of input: 66 DAG size of output 44 [2018-04-13 03:40:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:56,866 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2018-04-13 03:40:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:40:56,866 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-04-13 03:40:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:56,867 INFO L225 Difference]: With dead ends: 201 [2018-04-13 03:40:56,867 INFO L226 Difference]: Without dead ends: 201 [2018-04-13 03:40:56,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=308, Invalid=2662, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:40:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-13 03:40:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2018-04-13 03:40:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:40:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2018-04-13 03:40:56,870 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 32 [2018-04-13 03:40:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:56,871 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2018-04-13 03:40:56,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 03:40:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2018-04-13 03:40:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:40:56,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:56,871 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:56,871 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1308976227, now seen corresponding path program 1 times [2018-04-13 03:40:56,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:56,871 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:56,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:56,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:56,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:56,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:56,879 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:56,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:56,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:56,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:56,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:56,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-13 03:40:56,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:56,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:56,914 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-13 03:40:56,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,920 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-13 03:40:56,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,926 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-13 03:40:56,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 03:40:56,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:56,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:56,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:56,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-13 03:40:56,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 03:40:57,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:57,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:57,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:57,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:57,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-13 03:40:57,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-13 03:40:57,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 03:40:57,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:57,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:40:57,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:57,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:57,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:57,184 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:41 [2018-04-13 03:40:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:57,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:40:57,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:40:57,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:40:57,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:40:57,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:40:57,274 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand 17 states. [2018-04-13 03:40:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:58,875 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-04-13 03:40:58,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:40:58,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-04-13 03:40:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:58,875 INFO L225 Difference]: With dead ends: 167 [2018-04-13 03:40:58,875 INFO L226 Difference]: Without dead ends: 167 [2018-04-13 03:40:58,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:40:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-13 03:40:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2018-04-13 03:40:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-13 03:40:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2018-04-13 03:40:58,878 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 33 [2018-04-13 03:40:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:58,878 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2018-04-13 03:40:58,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:40:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2018-04-13 03:40:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:40:58,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:58,878 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:58,878 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash 137793725, now seen corresponding path program 2 times [2018-04-13 03:40:58,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:58,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:58,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:58,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:58,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:58,886 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:58,888 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:58,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:58,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:58,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:40:58,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:40:58,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:58,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:58,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-13 03:40:58,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:58,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:58,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:58,965 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-13 03:40:58,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2018-04-13 03:40:58,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:58,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:58,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-13 03:40:58,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:58,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:58,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:58,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:40:58,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,003 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-13 03:40:59,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:20 [2018-04-13 03:40:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:59,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:40:59,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:40:59,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:40:59,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:40:59,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:40:59,130 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 14 states. [2018-04-13 03:40:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:59,473 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-04-13 03:40:59,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:40:59,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-13 03:40:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:59,474 INFO L225 Difference]: With dead ends: 203 [2018-04-13 03:40:59,474 INFO L226 Difference]: Without dead ends: 200 [2018-04-13 03:40:59,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:40:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-13 03:40:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-04-13 03:40:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 03:40:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2018-04-13 03:40:59,478 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 34 [2018-04-13 03:40:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:59,479 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2018-04-13 03:40:59,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:40:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2018-04-13 03:40:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:40:59,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:59,480 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:59,480 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:40:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2061021759, now seen corresponding path program 1 times [2018-04-13 03:40:59,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:59,480 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:59,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:59,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:59,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:59,488 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:59,490 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:59,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:59,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:59,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:59,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:59,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:59,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:40:59,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:40:59,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:59,563 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-13 03:40:59,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:59,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:40:59,571 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-13 03:40:59,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-13 03:40:59,588 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-13 03:40:59,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 03:40:59,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 03:40:59,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 03:40:59,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:40:59,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:40:59,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-13 03:40:59,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-13 03:40:59,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-13 03:40:59,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:59,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:65 [2018-04-13 03:40:59,753 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-13 03:40:59,757 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-13 03:40:59,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:38 [2018-04-13 03:40:59,812 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-13 03:40:59,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:40:59,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:40:59,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:40:59,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:40:59,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:40:59,813 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 18 states. [2018-04-13 03:41:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:00,228 INFO L93 Difference]: Finished difference Result 164 states and 189 transitions. [2018-04-13 03:41:00,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:41:00,229 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-04-13 03:41:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:00,229 INFO L225 Difference]: With dead ends: 164 [2018-04-13 03:41:00,229 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 03:41:00,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:41:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 03:41:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2018-04-13 03:41:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-13 03:41:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2018-04-13 03:41:00,232 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 34 [2018-04-13 03:41:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:00,232 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2018-04-13 03:41:00,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:41:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2018-04-13 03:41:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 03:41:00,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:00,233 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:00,233 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash -4260326, now seen corresponding path program 1 times [2018-04-13 03:41:00,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:00,233 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:00,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:00,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:00,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:00,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:00,240 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:00,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:00,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:00,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:00,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:00,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:00,271 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-13 03:41:00,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 23 treesize of output 15 [2018-04-13 03:41:00,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:00,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:00,277 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-13 03:41:00,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 03:41:00,297 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-13 03:41:00,299 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-13 03:41:00,302 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-13 03:41:00,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:41:00,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:41:00,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:41:00,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:41:00,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 03:41:00,303 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 8 states. [2018-04-13 03:41:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:00,348 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2018-04-13 03:41:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:41:00,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-04-13 03:41:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:00,349 INFO L225 Difference]: With dead ends: 156 [2018-04-13 03:41:00,349 INFO L226 Difference]: Without dead ends: 115 [2018-04-13 03:41:00,349 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 03:41:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-13 03:41:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2018-04-13 03:41:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 03:41:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-04-13 03:41:00,350 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 35 [2018-04-13 03:41:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:00,350 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-04-13 03:41:00,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:41:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-04-13 03:41:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 03:41:00,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:00,351 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:00,351 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1859554796, now seen corresponding path program 4 times [2018-04-13 03:41:00,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:00,351 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:00,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:00,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:00,357 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:00,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:00,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:41:00,759 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:41:00,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:00,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:00,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:00,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:00,794 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-13 03:41:00,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 03:41:00,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:00,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:00,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:00,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:00,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:00,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:41:01,261 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 46 treesize of output 36 [2018-04-13 03:41:01,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:01,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:01,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 101 [2018-04-13 03:41:01,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 20 xjuncts. [2018-04-13 03:41:01,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:01,355 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 2 xjuncts. [2018-04-13 03:41:01,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:319 [2018-04-13 03:41:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:01,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:01,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-04-13 03:41:01,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:41:01,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:41:01,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:41:01,560 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 37 states. [2018-04-13 03:41:02,406 WARN L151 SmtUtils]: Spent 523ms on a formula simplification. DAG size of input: 62 DAG size of output 31 [2018-04-13 03:41:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:03,683 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-04-13 03:41:03,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:41:03,683 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 35 [2018-04-13 03:41:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:03,684 INFO L225 Difference]: With dead ends: 141 [2018-04-13 03:41:03,684 INFO L226 Difference]: Without dead ends: 141 [2018-04-13 03:41:03,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=448, Invalid=3092, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 03:41:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-13 03:41:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2018-04-13 03:41:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-13 03:41:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-04-13 03:41:03,687 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 35 [2018-04-13 03:41:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:03,687 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-04-13 03:41:03,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:41:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-04-13 03:41:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 03:41:03,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:03,688 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, 1] [2018-04-13 03:41:03,690 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash -532834899, now seen corresponding path program 1 times [2018-04-13 03:41:03,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:03,691 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:03,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:03,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:03,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:03,696 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:03,699 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:03,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:03,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:03,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:03,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:03,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-13 03:41:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:03,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-13 03:41:03,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:03,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:03,757 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-13 03:41:03,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:03,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 03:41:03,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,775 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-13 03:41:03,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-04-13 03:41:03,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:03,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, 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-13 03:41:03,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-13 03:41:03,918 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-13 03:41:03,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:03,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:41:03,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:41:03,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:41:03,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:41:03,919 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 19 states. [2018-04-13 03:41:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:04,302 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-04-13 03:41:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:41:04,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-04-13 03:41:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:04,303 INFO L225 Difference]: With dead ends: 132 [2018-04-13 03:41:04,303 INFO L226 Difference]: Without dead ends: 132 [2018-04-13 03:41:04,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:41:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-13 03:41:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-04-13 03:41:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 03:41:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-13 03:41:04,305 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 35 [2018-04-13 03:41:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:04,305 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-13 03:41:04,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:41:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-13 03:41:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 03:41:04,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:04,306 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:04,306 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1280639017, now seen corresponding path program 2 times [2018-04-13 03:41:04,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:04,306 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:04,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:04,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:04,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:04,313 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:04,317 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:04,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:04,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:04,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:41:04,351 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:41:04,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:04,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:04,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:04,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:04,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-13 03:41:04,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:04,410 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-13 03:41:04,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:04,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:04,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-13 03:41:04,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,430 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-13 03:41:04,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2018-04-13 03:41:04,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:04,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:04,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:04,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:04,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-13 03:41:04,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-13 03:41: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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:04,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:04,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:04,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:04,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:56 [2018-04-13 03:41:04,744 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-13 03:41:04,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:04,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:41:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:41:04,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:41:04,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:41:04,746 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 20 states. [2018-04-13 03:41:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:06,044 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-04-13 03:41:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:41:06,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-04-13 03:41:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:06,045 INFO L225 Difference]: With dead ends: 147 [2018-04-13 03:41:06,045 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 03:41:06,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:41:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 03:41:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-04-13 03:41:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 03:41:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-13 03:41:06,048 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 36 [2018-04-13 03:41:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:06,048 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-13 03:41:06,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:41:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-13 03:41:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:41:06,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:06,049 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:06,049 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:06,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1225150015, now seen corresponding path program 2 times [2018-04-13 03:41:06,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:06,050 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:06,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:06,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:06,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:06,058 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:06,063 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:06,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:06,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:41:06,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:41:06,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:06,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:06,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:06,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:06,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:41:06,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:06,124 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-13 03:41:06,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:06,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:06,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:41:06,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,141 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-13 03:41:06,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-13 03:41:06,161 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-13 03:41:06,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 03:41:06,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 03:41:06,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 03:41:06,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:06,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:06,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-13 03:41:06,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-13 03:41:06,305 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 18 treesize of output 27 [2018-04-13 03:41:06,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:06,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:06,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:06,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:60 [2018-04-13 03:41:06,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 03:41:06,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 10 treesize of output 9 [2018-04-13 03:41:06,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:06,453 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-13 03:41:06,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:21 [2018-04-13 03:41:06,483 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-13 03:41:06,487 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-13 03:41:06,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:06,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:06,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:06,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-13 03:41:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:06,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:06,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:41:06,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:41:06,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:41:06,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:41:06,544 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 19 states. [2018-04-13 03:41:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:06,954 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-04-13 03:41:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:41:06,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-13 03:41:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:06,955 INFO L225 Difference]: With dead ends: 152 [2018-04-13 03:41:06,955 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 03:41:06,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:41:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 03:41:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2018-04-13 03:41:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-13 03:41:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-13 03:41:06,958 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 39 [2018-04-13 03:41:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:06,958 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-13 03:41:06,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:41:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-13 03:41:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 03:41:06,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:06,959 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:41:06,959 INFO L408 AbstractCegarLoop]: === Iteration 35 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1099594077, now seen corresponding path program 3 times [2018-04-13 03:41:06,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:06,959 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:06,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:06,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:06,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:06,968 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:06,975 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:06,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:06,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:41:07,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:41:07,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:07,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:07,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:07,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:07,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,048 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-13 03:41:07,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:07,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:07,070 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 14 treesize of output 17 [2018-04-13 03:41:07,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:07,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:07,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:41:07,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,081 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-13 03:41:07,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-13 03:41:07,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:07,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:07,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:07,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-13 03:41:07,170 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 28 treesize of output 22 [2018-04-13 03:41:07,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:07,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-13 03:41:07,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:07,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:07,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:07,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2018-04-13 03:41:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:07,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:07,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:41:07,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:41:07,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:41:07,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:41:07,332 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 19 states. [2018-04-13 03:41:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:08,643 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-04-13 03:41:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:41:08,643 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-13 03:41:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:08,643 INFO L225 Difference]: With dead ends: 161 [2018-04-13 03:41:08,643 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 03:41:08,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=1115, Unknown=2, NotChecked=0, Total=1260 [2018-04-13 03:41:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 03:41:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2018-04-13 03:41:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-13 03:41:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-13 03:41:08,645 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 39 [2018-04-13 03:41:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:08,646 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-13 03:41:08,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:41:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-13 03:41:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 03:41:08,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:08,646 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, 1] [2018-04-13 03:41:08,646 INFO L408 AbstractCegarLoop]: === Iteration 36 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash 675055211, now seen corresponding path program 2 times [2018-04-13 03:41:08,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:08,646 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:08,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:08,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:08,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:08,651 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:08,654 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:08,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:08,654 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:41:08,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:41:08,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:08,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:08,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-13 03:41:08,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,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-13 03:41:08,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,692 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-13 03:41:08,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-13 03:41:08,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:08,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:08,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 03:41:08,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:08,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:08,720 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-13 03:41:08,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-13 03:41:08,866 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-13 03:41:08,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:08,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:41:08,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:41:08,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:41:08,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:41:08,867 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 17 states. [2018-04-13 03:41:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:09,214 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-04-13 03:41:09,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:41:09,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-13 03:41:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:09,215 INFO L225 Difference]: With dead ends: 151 [2018-04-13 03:41:09,215 INFO L226 Difference]: Without dead ends: 151 [2018-04-13 03:41:09,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:41:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-13 03:41:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136. [2018-04-13 03:41:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-13 03:41:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-13 03:41:09,218 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 40 [2018-04-13 03:41:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:09,218 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-13 03:41:09,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:41:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-13 03:41:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 03:41:09,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:09,219 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:09,219 INFO L408 AbstractCegarLoop]: === Iteration 37 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:09,219 INFO L82 PathProgramCache]: Analyzing trace with hash 146106796, now seen corresponding path program 5 times [2018-04-13 03:41:09,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:09,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:09,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:09,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:09,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:09,229 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:10,036 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-13 03:41:10,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:10,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:10,037 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:41:10,056 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-13 03:41:10,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:10,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:10,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:10,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:10,069 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-13 03:41:10,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 03:41:10,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:10,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:10,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:10,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:10,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:10,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-13 03:41:11,783 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-13 03:41:11,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:11,799 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-13 03:41:11,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:46 [2018-04-13 03:41:11,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-04-13 03:41:11,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:11,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:11,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:11,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:11,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:12,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 81 [2018-04-13 03:41:12,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:12,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:12,060 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-13 03:41:12,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:130 [2018-04-13 03:41:12,193 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-13 03:41:12,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:12,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2018-04-13 03:41:12,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:41:12,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:41:12,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1419, Unknown=3, NotChecked=0, Total=1640 [2018-04-13 03:41:12,195 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 41 states. [2018-04-13 03:41:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:13,455 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-04-13 03:41:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:41:13,455 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-04-13 03:41:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:13,456 INFO L225 Difference]: With dead ends: 195 [2018-04-13 03:41:13,456 INFO L226 Difference]: Without dead ends: 195 [2018-04-13 03:41:13,456 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=579, Invalid=3708, Unknown=3, NotChecked=0, Total=4290 [2018-04-13 03:41:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-13 03:41:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2018-04-13 03:41:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 03:41:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2018-04-13 03:41:13,459 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 41 [2018-04-13 03:41:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:13,459 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2018-04-13 03:41:13,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:41:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2018-04-13 03:41:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 03:41:13,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:13,460 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 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-13 03:41:13,460 INFO L408 AbstractCegarLoop]: === Iteration 38 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash -137596535, now seen corresponding path program 1 times [2018-04-13 03:41:13,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:13,460 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:13,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:13,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:13,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:13,482 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:13,486 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:13,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:13,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:13,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:13,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:13,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:41:13,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:13,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:13,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, 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-13 03:41:13,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,534 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-13 03:41:13,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-13 03:41:13,549 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-13 03:41:13,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 13 treesize of output 12 [2018-04-13 03:41:13,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 03:41:13,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 03:41:13,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 11 treesize of output 10 [2018-04-13 03:41:13,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:13,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-04-13 03:41:13,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-13 03:41:13,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-13 03:41:13,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:13,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:57 [2018-04-13 03:41:13,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-13 03:41:13,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 8 treesize of output 7 [2018-04-13 03:41:13,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:13,721 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-13 03:41:13,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-04-13 03:41:13,754 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-13 03:41:13,758 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-13 03:41:13,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:39 [2018-04-13 03:41:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 03:41:13,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:13,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:41:13,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:41:13,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:41:13,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:41:13,821 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand 19 states. [2018-04-13 03:41:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:14,182 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2018-04-13 03:41:14,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:41:14,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-04-13 03:41:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:14,182 INFO L225 Difference]: With dead ends: 184 [2018-04-13 03:41:14,182 INFO L226 Difference]: Without dead ends: 184 [2018-04-13 03:41:14,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:41:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-13 03:41:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2018-04-13 03:41:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 03:41:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-04-13 03:41:14,184 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 42 [2018-04-13 03:41:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:14,185 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-04-13 03:41:14,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:41:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-04-13 03:41:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 03:41:14,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:14,185 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:41:14,185 INFO L408 AbstractCegarLoop]: === Iteration 39 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash -713640471, now seen corresponding path program 4 times [2018-04-13 03:41:14,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:14,185 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:14,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:14,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:14,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:14,190 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:14,195 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:14,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:14,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:14,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:41:14,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:41:14,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:14,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:14,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:14,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:14,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:14,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:14,231 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-13 03:41:14,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:14,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:14,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:14,245 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-13 03:41:14,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:14,267 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 14 treesize of output 17 [2018-04-13 03:41:14,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:14,273 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-13 03:41:14,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-13 03:41:14,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:14,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:14,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:14,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:14,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:14,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-13 03:41:14,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-13 03:41:14,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:14,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:14,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:14,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-04-13 03:41:14,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:14,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:14,535 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-13 03:41:14,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:134 [2018-04-13 03:41:14,760 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-13 03:41:14,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:14,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:41:14,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:41:14,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:41:14,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:41:14,761 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 21 states. [2018-04-13 03:41:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:15,725 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-04-13 03:41:15,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:41:15,725 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-04-13 03:41:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:15,726 INFO L225 Difference]: With dead ends: 197 [2018-04-13 03:41:15,726 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 03:41:15,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=1555, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:41:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 03:41:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2018-04-13 03:41:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 03:41:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-04-13 03:41:15,728 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 42 [2018-04-13 03:41:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:15,729 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-04-13 03:41:15,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:41:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-04-13 03:41:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 03:41:15,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:15,729 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 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-13 03:41:15,729 INFO L408 AbstractCegarLoop]: === Iteration 40 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 29474723, now seen corresponding path program 5 times [2018-04-13 03:41:15,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:15,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:15,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:15,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:15,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:15,737 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:15,740 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:15,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:15,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:41:15,775 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-13 03:41:15,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:15,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:15,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-13 03:41:15,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:15,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-13 03:41:15,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:15,802 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-13 03:41:15,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:15,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:15,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:15,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 03:41:15,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:15,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:15,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:15,840 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-13 03:41:15,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:15,850 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-13 03:41:15,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2018-04-13 03:41:15,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:15,993 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-13 03:41:15,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:15,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:15,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2018-04-13 03:41:16,062 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-13 03:41:16,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:16,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:41:16,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:41:16,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:41:16,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:41:16,063 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 18 states. [2018-04-13 03:41:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:16,518 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2018-04-13 03:41:16,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:41:16,518 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-04-13 03:41:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:16,519 INFO L225 Difference]: With dead ends: 199 [2018-04-13 03:41:16,519 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 03:41:16,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:41:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 03:41:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2018-04-13 03:41:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 03:41:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-04-13 03:41:16,521 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 43 [2018-04-13 03:41:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:16,521 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-04-13 03:41:16,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:41:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-04-13 03:41:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:41:16,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:16,521 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:16,522 INFO L408 AbstractCegarLoop]: === Iteration 41 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 276173695, now seen corresponding path program 3 times [2018-04-13 03:41:16,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:16,522 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:16,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:16,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:16,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:16,530 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:16,535 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:16,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:16,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:16,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:41:16,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-13 03:41:16,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:16,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:16,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:16,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:41:16,622 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-13 03:41:16,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:16,634 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-13 03:41:16,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:29 [2018-04-13 03:41:16,671 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 29 treesize of output 26 [2018-04-13 03:41:16,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 03:41:16,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-13 03:41:16,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:16,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:16,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:53 [2018-04-13 03:41:16,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 53 [2018-04-13 03:41:16,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-04-13 03:41:16,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,860 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 49 treesize of output 44 [2018-04-13 03:41:16,866 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 20 treesize of output 21 [2018-04-13 03:41:16,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:16,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:83 [2018-04-13 03:41:17,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-04-13 03:41:17,108 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 56 treesize of output 64 [2018-04-13 03:41:17,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:17,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:17,206 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 63 treesize of output 54 [2018-04-13 03:41:17,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:41:17,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-04-13 03:41:17,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-13 03:41:17,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:121, output treesize:137 [2018-04-13 03:41:19,342 WARN L151 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 75 DAG size of output 71 [2018-04-13 03:41:19,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:19,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:19,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 69 treesize of output 72 [2018-04-13 03:41:19,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:19,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:19,483 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 97 [2018-04-13 03:41:19,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 20 xjuncts. [2018-04-13 03:41:19,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-04-13 03:41:19,794 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 58 treesize of output 51 [2018-04-13 03:41:19,799 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 2 case distinctions, treesize of input 24 treesize of output 31 [2018-04-13 03:41:19,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:19,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:19,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 42 dim-0 vars, and 11 xjuncts. [2018-04-13 03:41:19,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:128, output treesize:687 [2018-04-13 03:41:20,119 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 31 treesize of output 32 [2018-04-13 03:41:20,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:41:20,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:20,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:20,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:20,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:26 [2018-04-13 03:41:20,180 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 29 treesize of output 23 [2018-04-13 03:41:20,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2018-04-13 03:41:20,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-04-13 03:41:20,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:20,206 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-13 03:41:20,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:43 [2018-04-13 03:41:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:20,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:20,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:41:20,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:41:20,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:41:20,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=446, Unknown=3, NotChecked=0, Total=506 [2018-04-13 03:41:20,292 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 23 states. [2018-04-13 03:41:20,658 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 68 DAG size of output 61 [2018-04-13 03:41:21,011 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 111 DAG size of output 94 [2018-04-13 03:41:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:21,507 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2018-04-13 03:41:21,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:41:21,507 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-04-13 03:41:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:21,508 INFO L225 Difference]: With dead ends: 204 [2018-04-13 03:41:21,508 INFO L226 Difference]: Without dead ends: 204 [2018-04-13 03:41:21,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=152, Invalid=1177, Unknown=3, NotChecked=0, Total=1332 [2018-04-13 03:41:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-13 03:41:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-04-13 03:41:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-13 03:41:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2018-04-13 03:41:21,510 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 44 [2018-04-13 03:41:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:21,511 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2018-04-13 03:41:21,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:41:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2018-04-13 03:41:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:41:21,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:21,511 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:21,511 INFO L408 AbstractCegarLoop]: === Iteration 42 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -118193091, now seen corresponding path program 1 times [2018-04-13 03:41:21,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:21,511 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:21,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:21,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:21,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:21,519 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:21,523 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:21,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:21,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:21,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:21,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:21,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:21,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:41:21,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:21,607 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-13 03:41:21,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:21,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:21,623 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-13 03:41:21,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,633 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-13 03:41:21,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-13 03:41:21,657 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-13 03:41:21,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 03:41:21,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-13 03:41:21,681 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 26 treesize of output 27 [2018-04-13 03:41:21,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:21,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:21,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-04-13 03:41:21,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-13 03:41:21,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-13 03:41:21,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:21,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:21,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:21,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:69 [2018-04-13 03:41:21,899 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-13 03:41:21,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2018-04-13 03:41:21,918 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-13 03:41:21,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 03:41:21,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,933 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-13 03:41:21,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 03:41:21,966 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-13 03:41:21,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 03:41:21,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,975 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-13 03:41:21,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-13 03:41:22,007 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-13 03:41:22,011 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-13 03:41:22,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:22,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:22,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:22,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-13 03:41:22,066 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-13 03:41:22,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:22,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:41:22,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:41:22,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:41:22,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:41:22,067 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand 22 states. [2018-04-13 03:41:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:26,028 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2018-04-13 03:41:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:41:26,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-04-13 03:41:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:26,029 INFO L225 Difference]: With dead ends: 208 [2018-04-13 03:41:26,029 INFO L226 Difference]: Without dead ends: 208 [2018-04-13 03:41:26,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:41:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-13 03:41:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 137. [2018-04-13 03:41:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 03:41:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-04-13 03:41:26,032 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 44 [2018-04-13 03:41:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:26,033 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-04-13 03:41:26,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:41:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-04-13 03:41:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 03:41:26,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:26,033 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, 1] [2018-04-13 03:41:26,033 INFO L408 AbstractCegarLoop]: === Iteration 43 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash -28550035, now seen corresponding path program 3 times [2018-04-13 03:41:26,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:26,034 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:26,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:26,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:26,042 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:26,047 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:26,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:26,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:26,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:41:26,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-13 03:41:26,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:26,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:26,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:26,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:26,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,121 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-13 03:41:26,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:26,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:26,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:26,141 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-13 03:41:26,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:26,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 03:41:26,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,158 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-13 03:41:26,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-13 03:41:26,343 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-13 03:41:26,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:26,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:41:26,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:41:26,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:41:26,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:41:26,345 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 17 states. [2018-04-13 03:41:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:26,762 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2018-04-13 03:41:26,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:41:26,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-04-13 03:41:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:26,763 INFO L225 Difference]: With dead ends: 162 [2018-04-13 03:41:26,763 INFO L226 Difference]: Without dead ends: 162 [2018-04-13 03:41:26,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:41:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-13 03:41:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2018-04-13 03:41:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:41:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-13 03:41:26,765 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 45 [2018-04-13 03:41:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:26,765 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-13 03:41:26,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:41:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-13 03:41:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 03:41:26,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:26,766 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:41:26,766 INFO L408 AbstractCegarLoop]: === Iteration 44 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -397215517, now seen corresponding path program 6 times [2018-04-13 03:41:26,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:26,766 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:26,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:26,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:26,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:26,788 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:26,796 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:26,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:26,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:26,797 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:41:26,847 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-13 03:41:26,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:26,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:26,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-13 03:41:26,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:26,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 03:41:26,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:26,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:26,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 03:41:26,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,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-13 03:41:26,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,917 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-13 03:41:26,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:23 [2018-04-13 03:41:26,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:26,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:26,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:26,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:26,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-13 03:41:27,186 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 41 treesize of output 31 [2018-04-13 03:41:27,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 65 [2018-04-13 03:41:27,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-04-13 03:41:27,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:27,245 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-13 03:41:27,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:171 [2018-04-13 03:41:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:27,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:27,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:41:27,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:41:27,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:41:27,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:41:27,470 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 25 states. [2018-04-13 03:41:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:28,459 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2018-04-13 03:41:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:41:28,459 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-04-13 03:41:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:28,460 INFO L225 Difference]: With dead ends: 188 [2018-04-13 03:41:28,460 INFO L226 Difference]: Without dead ends: 188 [2018-04-13 03:41:28,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=2225, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:41:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-13 03:41:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 142. [2018-04-13 03:41:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:41:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-13 03:41:28,462 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 45 [2018-04-13 03:41:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:28,462 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-13 03:41:28,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:41:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-13 03:41:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 03:41:28,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:28,463 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 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-13 03:41:28,463 INFO L408 AbstractCegarLoop]: === Iteration 45 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1248713705, now seen corresponding path program 7 times [2018-04-13 03:41:28,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:28,463 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:28,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:28,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:28,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:28,469 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:28,473 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:28,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:28,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:28,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:28,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-13 03:41:28,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:28,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:28,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:28,524 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-13 03:41:28,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:28,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:28,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:28,544 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-13 03:41:28,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:28,554 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 14 treesize of output 17 [2018-04-13 03:41:28,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:28,561 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-13 03:41:28,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-13 03:41:28,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:28,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:28,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:28,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:28,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:28,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-13 03:41:28,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-13 03:41:28,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:28,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:28,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:28,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:28,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:52 [2018-04-13 03:41:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:28,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:28,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:41:28,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:41:28,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:41:28,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:41:28,848 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 19 states. [2018-04-13 03:41:29,363 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 54 DAG size of output 51 [2018-04-13 03:41:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:29,794 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2018-04-13 03:41:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:41:29,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-04-13 03:41:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:29,795 INFO L225 Difference]: With dead ends: 194 [2018-04-13 03:41:29,795 INFO L226 Difference]: Without dead ends: 194 [2018-04-13 03:41:29,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:41:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-13 03:41:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 142. [2018-04-13 03:41:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:41:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-13 03:41:29,797 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 46 [2018-04-13 03:41:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:29,798 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-13 03:41:29,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:41:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-13 03:41:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 03:41:29,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:29,798 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:41:29,798 INFO L408 AbstractCegarLoop]: === Iteration 46 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1234625623, now seen corresponding path program 8 times [2018-04-13 03:41:29,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:29,799 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:29,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:29,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:29,814 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:29,826 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:29,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:29,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:29,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:41:29,872 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:41:29,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:29,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:29,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:29,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,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-13 03:41:29,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 03:41:29,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:29,927 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-13 03:41:29,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:29,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:29,937 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-13 03:41:29,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,943 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-13 03:41:29,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:23 [2018-04-13 03:41:29,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:29,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 11 treesize of output 10 [2018-04-13 03:41:29,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:29,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:29,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-13 03:41:30,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2018-04-13 03:41:30,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:30,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:30,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:30,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:30,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 67 [2018-04-13 03:41:30,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:30,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:30,223 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-13 03:41:30,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:185 [2018-04-13 03:41:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:30,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:30,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:41:30,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:41:30,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:41:30,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:41:30,430 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 27 states. [2018-04-13 03:41:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:31,646 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-04-13 03:41:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:41:31,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-04-13 03:41:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:31,647 INFO L225 Difference]: With dead ends: 178 [2018-04-13 03:41:31,647 INFO L226 Difference]: Without dead ends: 178 [2018-04-13 03:41:31,647 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=228, Invalid=2634, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:41:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-13 03:41:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 142. [2018-04-13 03:41:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:41:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-13 03:41:31,651 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 48 [2018-04-13 03:41:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:31,651 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-13 03:41:31,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:41:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-13 03:41:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 03:41:31,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:31,652 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:41:31,652 INFO L408 AbstractCegarLoop]: === Iteration 47 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1058804195, now seen corresponding path program 9 times [2018-04-13 03:41:31,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:31,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:31,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:31,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:31,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:31,663 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:31,671 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:31,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:31,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:31,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:41:31,710 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:41:31,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:31,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:31,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:31,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:31,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:31,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:31,744 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-13 03:41:31,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:31,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:31,763 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 14 treesize of output 17 [2018-04-13 03:41:31,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:31,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:31,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:31,775 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-13 03:41:31,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:31,782 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-13 03:41:31,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-13 03:41:31,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:31,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:31,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:31,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:31,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:31,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-13 03:41:31,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-13 03:41:31,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:31,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-04-13 03:41:31,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:31,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:31,969 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-13 03:41:31,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:91 [2018-04-13 03:41:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:32,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:32,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:41:32,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:41:32,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:41:32,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:41:32,188 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 21 states. [2018-04-13 03:41:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:32,982 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-04-13 03:41:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:41:32,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-04-13 03:41:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:32,982 INFO L225 Difference]: With dead ends: 196 [2018-04-13 03:41:32,982 INFO L226 Difference]: Without dead ends: 196 [2018-04-13 03:41:32,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:41:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-13 03:41:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2018-04-13 03:41:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 03:41:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-13 03:41:32,986 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 49 [2018-04-13 03:41:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:32,986 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-13 03:41:32,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:41:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-13 03:41:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 03:41:32,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:32,987 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, 1] [2018-04-13 03:41:32,987 INFO L408 AbstractCegarLoop]: === Iteration 48 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash -904136789, now seen corresponding path program 4 times [2018-04-13 03:41:32,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:32,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:32,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:32,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:32,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:32,996 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:33,000 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:33,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:33,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:41:33,023 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:41:33,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:33,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:33,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:33,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:33,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,066 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-13 03:41:33,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:33,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:33,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:33,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-13 03:41:33,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:33,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 03:41:33,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,101 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-13 03:41:33,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-13 03:41:33,285 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-13 03:41:33,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:33,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:41:33,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:41:33,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:41:33,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:41:33,286 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 18 states. [2018-04-13 03:41:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:33,745 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2018-04-13 03:41:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:41:33,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-04-13 03:41:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:33,746 INFO L225 Difference]: With dead ends: 172 [2018-04-13 03:41:33,746 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 03:41:33,746 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:41:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 03:41:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2018-04-13 03:41:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-13 03:41:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-04-13 03:41:33,748 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 50 [2018-04-13 03:41:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:33,748 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-04-13 03:41:33,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:41:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-04-13 03:41:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-13 03:41:33,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:33,749 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-13 03:41:33,749 INFO L408 AbstractCegarLoop]: === Iteration 49 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash 945928995, now seen corresponding path program 10 times [2018-04-13 03:41:33,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:33,749 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:33,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:33,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:33,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:33,759 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:33,761 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:33,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:33,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:33,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:41:33,788 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:41:33,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:33,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:33,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:33,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:33,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,803 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-13 03:41:33,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-13 03:41:33,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:33,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:33,817 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-13 03:41:33,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,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 14 treesize of output 17 [2018-04-13 03:41:33,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,851 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-13 03:41:33,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-13 03:41:33,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:33,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:33,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:33,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:33,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-13 03:41:34,202 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 57 treesize of output 43 [2018-04-13 03:41:34,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:34,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:34,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:34,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:34,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:34,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 81 [2018-04-13 03:41:34,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:34,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:34,268 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-13 03:41:34,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:205 [2018-04-13 03:41:34,471 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-13 03:41:34,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:34,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:41:34,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:41:34,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:41:34,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:41:34,471 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 28 states. [2018-04-13 03:41:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:35,617 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-04-13 03:41:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 03:41:35,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-04-13 03:41:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:35,618 INFO L225 Difference]: With dead ends: 187 [2018-04-13 03:41:35,618 INFO L226 Difference]: Without dead ends: 187 [2018-04-13 03:41:35,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=234, Invalid=2958, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 03:41:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-13 03:41:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 147. [2018-04-13 03:41:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-13 03:41:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-04-13 03:41:35,620 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 51 [2018-04-13 03:41:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:35,620 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-04-13 03:41:35,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:41:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-04-13 03:41:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 03:41:35,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:35,621 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:35,621 INFO L408 AbstractCegarLoop]: === Iteration 50 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash -63479383, now seen corresponding path program 11 times [2018-04-13 03:41:35,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:35,621 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:35,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:35,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:35,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:35,629 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:35,637 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:41:35,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:35,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:35,638 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:41:35,686 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-13 03:41:35,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:35,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:35,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:35,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:35,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:41:35,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:35,713 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-13 03:41:35,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-13 03:41:35,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:35,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:35,750 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-13 03:41:35,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:35,763 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 14 treesize of output 17 [2018-04-13 03:41:35,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:35,770 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-13 03:41:35,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:30 [2018-04-13 03:41:35,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:35,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:35,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:35,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:35,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:35,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-13 03:41:35,942 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 33 treesize of output 25 [2018-04-13 03:41:35,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:35,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:35,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 39 [2018-04-13 03:41:35,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:35,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:35,977 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-13 03:41:35,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:141 [2018-04-13 03:41:36,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:41:36,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 03:41:36,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:36,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:36,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2018-04-13 03:41:36,172 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-13 03:41:36,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:41:36,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:41:36,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:41:36,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:41:36,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:41:36,173 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 23 states. [2018-04-13 03:41:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:36,938 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2018-04-13 03:41:36,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:41:36,938 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-13 03:41:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:36,939 INFO L225 Difference]: With dead ends: 189 [2018-04-13 03:41:36,939 INFO L226 Difference]: Without dead ends: 189 [2018-04-13 03:41:36,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:41:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-13 03:41:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2018-04-13 03:41:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-13 03:41:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-04-13 03:41:36,941 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 52 [2018-04-13 03:41:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:36,941 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-04-13 03:41:36,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:41:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-04-13 03:41:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 03:41:36,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:36,941 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:36,942 INFO L408 AbstractCegarLoop]: === Iteration 51 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 03:41:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1692159700, now seen corresponding path program 6 times [2018-04-13 03:41:36,942 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:36,942 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:36,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:36,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:36,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:36,955 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:37,458 WARN L151 SmtUtils]: Spent 293ms on a formula simplification. DAG size of input: 288 DAG size of output 81 [2018-04-13 03:41:37,696 WARN L151 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 216 DAG size of output 74 [2018-04-13 03:41:37,957 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 216 DAG size of output 74 [2018-04-13 03:41:38,203 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 218 DAG size of output 74 [2018-04-13 03:41:38,491 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 234 DAG size of output 81 [2018-04-13 03:41:38,784 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 236 DAG size of output 81 [2018-04-13 03:41:39,005 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 161 DAG size of output 72 [2018-04-13 03:41:39,245 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 163 DAG size of output 72 [2018-04-13 03:41:40,217 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-13 03:41:40,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:40,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:40,218 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:41:40,271 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-13 03:41:40,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:40,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:40,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-13 03:41:40,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:40,350 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-13 03:41:40,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 03:41:40,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 03:41:40,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:41:40,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:40,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:40,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:40,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:41:40,785 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-13 03:41:40,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:40,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 03:41:40,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:82, output treesize:77 [2018-04-13 03:43:53,694 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 92 treesize of output 70 [2018-04-13 03:43:53,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:43:54,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 19 disjoint index pairs (out of 55 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 70 treesize of output 487 [2018-04-13 03:43:54,031 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 45