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/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:53:10,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:53:10,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:53:10,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:53:10,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:53:10,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:53:10,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:53:10,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:53:10,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:53:10,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:53:10,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:53:10,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:53:10,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:53:10,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:53:10,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:53:10,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:53:10,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:53:10,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:53:10,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:53:10,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:53:10,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:53:10,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:53:10,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:53:10,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:53:10,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:53:10,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:53:10,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:53:10,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:53:10,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:53:10,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:53:10,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:53:10,357 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:53:10,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:53:10,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:53:10,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:53:10,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:53:10,368 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:53:10,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:53:10,369 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:53:10,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:53:10,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:53:10,370 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 03:53:10,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 03:53:10,371 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:53:10,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:53:10,407 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:53:10,410 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:53:10,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:53:10,412 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:53:10,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,814 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8a9cbe685 [2018-04-13 03:53:10,927 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:53:10,927 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:53:10,927 INFO L168 CDTParser]: Scanning cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,935 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:53:10,935 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:53:10,935 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:53:10,936 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,936 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,936 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,936 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,936 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:53:10,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__uint in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:10,959 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8a9cbe685 [2018-04-13 03:53:10,963 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:53:10,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:53:10,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:53:10,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:53:10,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:53:10,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:53:10" (1/1) ... [2018-04-13 03:53:10,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0334c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:10, skipping insertion in model container [2018-04-13 03:53:10,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:53:10" (1/1) ... [2018-04-13 03:53:10,986 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:53:11,007 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:53:11,149 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:53:11,186 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:53:11,191 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 03:53:11,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11 WrapperNode [2018-04-13 03:53:11,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:53:11,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:53:11,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:53:11,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:53:11,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (1/1) ... [2018-04-13 03:53:11,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:53:11,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:53:11,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:53:11,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:53:11,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (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:53:11,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:53:11,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:53:11,370 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:53:11,370 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:53:11,370 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-04-13 03:53:11,371 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncmp_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:53:11,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:53:11,372 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:53:11,373 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:53:11,374 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:53:11,375 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:53:11,376 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:53:11,377 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:53:11,378 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:53:11,379 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-04-13 03:53:11,380 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:53:11,381 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:53:11,660 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:53:11,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:53:11 BoogieIcfgContainer [2018-04-13 03:53:11,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:53:11,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:53:11,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:53:11,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:53:11,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:53:10" (1/3) ... [2018-04-13 03:53:11,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba1a885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:53:11, skipping insertion in model container [2018-04-13 03:53:11,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:53:11" (2/3) ... [2018-04-13 03:53:11,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba1a885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:53:11, skipping insertion in model container [2018-04-13 03:53:11,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:53:11" (3/3) ... [2018-04-13 03:53:11,667 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:53:11,672 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:53:11,677 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-13 03:53:11,704 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:53:11,705 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:53:11,705 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:53:11,705 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 03:53:11,705 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 03:53:11,705 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:53:11,705 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:53:11,705 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:53:11,705 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:53:11,706 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:53:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-04-13 03:53:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:53:11,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:11,720 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:11,720 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -878219724, now seen corresponding path program 1 times [2018-04-13 03:53:11,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:11,724 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:11,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:11,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:11,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:11,789 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:11,801 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:11,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:11,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:11,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:11,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:11,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:11,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:11,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:11,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 03:53:11,893 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:53:11,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:11,897 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:53:11,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 03:53:11,904 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:53:11,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:11,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:53:11,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:53:11,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:53:11,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:53:11,917 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-04-13 03:53:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,003 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-04-13 03:53:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:53:12,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-13 03:53:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,014 INFO L225 Difference]: With dead ends: 60 [2018-04-13 03:53:12,014 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 03:53:12,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:53:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 03:53:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 03:53:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 03:53:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-04-13 03:53:12,042 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-04-13 03:53:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,042 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-04-13 03:53:12,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:53:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-04-13 03:53:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:53:12,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,043 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:12,043 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash -878219723, now seen corresponding path program 1 times [2018-04-13 03:53:12,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,055 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,061 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:12,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:12,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:12,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:12,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:12,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 03:53:12,120 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:53:12,121 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 14 [2018-04-13 03:53:12,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,127 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:53:12,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-04-13 03:53:12,147 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:53:12,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 03:53:12,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 03:53:12,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 03:53:12,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:53:12,149 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-04-13 03:53:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,248 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-04-13 03:53:12,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:53:12,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-04-13 03:53:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,250 INFO L225 Difference]: With dead ends: 93 [2018-04-13 03:53:12,251 INFO L226 Difference]: Without dead ends: 93 [2018-04-13 03:53:12,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-13 03:53:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2018-04-13 03:53:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 03:53:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-04-13 03:53:12,260 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 13 [2018-04-13 03:53:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,261 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-04-13 03:53:12,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 03:53:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-04-13 03:53:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:53:12,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,261 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:12,261 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash -820961421, now seen corresponding path program 1 times [2018-04-13 03:53:12,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,262 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,272 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,275 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:12,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:12,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:12,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:12,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:12,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:12,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:12,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:12,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:12,336 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:53:12,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,346 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:53:12,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,353 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:53:12,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:12,363 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:53:12,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:12,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:53:12,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:53:12,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:12,364 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2018-04-13 03:53:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,451 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-04-13 03:53:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:12,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 03:53:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,452 INFO L225 Difference]: With dead ends: 80 [2018-04-13 03:53:12,452 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 03:53:12,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:53:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 03:53:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-04-13 03:53:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 03:53:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-04-13 03:53:12,457 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 13 [2018-04-13 03:53:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,457 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-04-13 03:53:12,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:53:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-04-13 03:53:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:53:12,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,458 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:12,458 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 896787639, now seen corresponding path program 1 times [2018-04-13 03:53:12,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,468 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,471 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:12,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:12,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:12,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:12,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:12,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:12,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:12,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:12,530 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:53:12,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 03:53:12,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:12,543 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:53:12,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 03:53:12,558 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:53:12,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:53:12,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:53:12,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:53:12,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:12,559 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2018-04-13 03:53:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,640 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-04-13 03:53:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:12,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 03:53:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,641 INFO L225 Difference]: With dead ends: 62 [2018-04-13 03:53:12,641 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 03:53:12,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:53:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 03:53:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-04-13 03:53:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 03:53:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-04-13 03:53:12,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-04-13 03:53:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,644 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-04-13 03:53:12,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:53:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-04-13 03:53:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 03:53:12,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,644 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:12,644 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1455007674, now seen corresponding path program 1 times [2018-04-13 03:53:12,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,652 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,665 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:53:12,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:53:12,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:53:12,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:53:12,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:53:12,666 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-04-13 03:53:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,689 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-04-13 03:53:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:53:12,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 03:53:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,689 INFO L225 Difference]: With dead ends: 55 [2018-04-13 03:53:12,690 INFO L226 Difference]: Without dead ends: 55 [2018-04-13 03:53:12,690 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:53:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-13 03:53:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-13 03:53:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 03:53:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-04-13 03:53:12,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-04-13 03:53:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,693 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-04-13 03:53:12,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:53:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-04-13 03:53:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 03:53:12,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,694 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:12,694 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1455007673, now seen corresponding path program 1 times [2018-04-13 03:53:12,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,694 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,700 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,721 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:53:12,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:12,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:12,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:12,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:12,722 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-04-13 03:53:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,755 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-13 03:53:12,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:53:12,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 03:53:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,756 INFO L225 Difference]: With dead ends: 54 [2018-04-13 03:53:12,756 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 03:53:12,756 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:53:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 03:53:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 03:53:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 03:53:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-04-13 03:53:12,759 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-04-13 03:53:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,760 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-04-13 03:53:12,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-04-13 03:53:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 03:53:12,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,760 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] [2018-04-13 03:53:12,760 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,761 INFO L82 PathProgramCache]: Analyzing trace with hash 8354905, now seen corresponding path program 1 times [2018-04-13 03:53:12,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,761 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,771 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,792 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:53:12,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:12,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:12,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:12,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:12,793 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-04-13 03:53:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,829 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-04-13 03:53:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:53:12,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-13 03:53:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,829 INFO L225 Difference]: With dead ends: 51 [2018-04-13 03:53:12,829 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 03:53:12,830 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:53:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 03:53:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 03:53:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 03:53:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-04-13 03:53:12,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-04-13 03:53:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:12,832 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-04-13 03:53:12,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-04-13 03:53:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 03:53:12,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:12,833 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] [2018-04-13 03:53:12,833 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 8354906, now seen corresponding path program 1 times [2018-04-13 03:53:12,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:12,833 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:12,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:12,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:12,842 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:12,892 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:53:12,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:12,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:53:12,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:53:12,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:53:12,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:12,893 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-04-13 03:53:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:12,991 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-04-13 03:53:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:53:12,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-13 03:53:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:12,993 INFO L225 Difference]: With dead ends: 74 [2018-04-13 03:53:12,994 INFO L226 Difference]: Without dead ends: 74 [2018-04-13 03:53:12,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:53:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-13 03:53:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-04-13 03:53:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-13 03:53:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-04-13 03:53:12,999 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-04-13 03:53:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:13,000 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-04-13 03:53:13,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:53:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-04-13 03:53:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:13,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:13,000 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] [2018-04-13 03:53:13,001 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash 259002080, now seen corresponding path program 1 times [2018-04-13 03:53:13,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:13,001 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:13,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,009 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:13,027 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:53:13,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:13,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:53:13,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:53:13,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:53:13,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:53:13,027 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-04-13 03:53:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:13,058 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-04-13 03:53:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:53:13,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-13 03:53:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:13,059 INFO L225 Difference]: With dead ends: 59 [2018-04-13 03:53:13,059 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 03:53:13,059 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:53:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 03:53:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-04-13 03:53:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-13 03:53:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-04-13 03:53:13,062 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-04-13 03:53:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:13,062 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-04-13 03:53:13,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:53:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-04-13 03:53:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 03:53:13,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:13,063 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] [2018-04-13 03:53:13,063 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:13,064 INFO L82 PathProgramCache]: Analyzing trace with hash 259002081, now seen corresponding path program 1 times [2018-04-13 03:53:13,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:13,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:13,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,071 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:13,121 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:53:13,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:13,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:53:13,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:53:13,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:53:13,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:53:13,122 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-04-13 03:53:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:13,199 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-04-13 03:53:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:53:13,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-04-13 03:53:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:13,200 INFO L225 Difference]: With dead ends: 68 [2018-04-13 03:53:13,200 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 03:53:13,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:53:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 03:53:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-04-13 03:53:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-13 03:53:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-04-13 03:53:13,204 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-04-13 03:53:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:13,204 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-04-13 03:53:13,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:53:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-04-13 03:53:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 03:53:13,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:13,205 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:13,205 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash -633449795, now seen corresponding path program 1 times [2018-04-13 03:53:13,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:13,205 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:13,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,214 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:13,216 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:13,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:13,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:13,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:13,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 03:53:13,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:13,267 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:53:13,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,293 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:53:13,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 03:53:13,315 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc15.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc15.base| 1))) (and (= 0 (select .cse0 |c_main_#t~malloc16.base|)) (= (select |c_old(#valid)| |main_#t~malloc15.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc16.base| 1) |main_#t~malloc15.base| 0))))) is different from true [2018-04-13 03:53:13,323 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc16.base| Int) (|main_#t~malloc15.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc15.base| 1))) (and (= 0 (select .cse0 |main_#t~malloc16.base|)) (= (select |c_old(#valid)| |main_#t~malloc15.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc16.base| 1) |main_#t~malloc15.base| 0) |main_#t~malloc16.base| 0))))) is different from true [2018-04-13 03:53:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:13,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:13,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 03:53:13,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:53:13,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:53:13,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 03:53:13,329 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 8 states. [2018-04-13 03:53:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:13,406 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-04-13 03:53:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:53:13,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-04-13 03:53:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:13,406 INFO L225 Difference]: With dead ends: 60 [2018-04-13 03:53:13,406 INFO L226 Difference]: Without dead ends: 46 [2018-04-13 03:53:13,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 03:53:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-13 03:53:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-13 03:53:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 03:53:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-04-13 03:53:13,408 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-04-13 03:53:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:13,409 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-04-13 03:53:13,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:53:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-04-13 03:53:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 03:53:13,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:13,409 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:53:13,409 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash 517212813, now seen corresponding path program 1 times [2018-04-13 03:53:13,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:13,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:13,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,416 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:13,437 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:53:13,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:13,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:53:13,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 03:53:13,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 03:53:13,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:53:13,439 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-04-13 03:53:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:13,444 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-13 03:53:13,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 03:53:13,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-13 03:53:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:13,445 INFO L225 Difference]: With dead ends: 48 [2018-04-13 03:53:13,445 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 03:53:13,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:53:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 03:53:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 03:53:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 03:53:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-13 03:53:13,448 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-04-13 03:53:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:13,448 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-13 03:53:13,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 03:53:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-13 03:53:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 03:53:13,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:13,449 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:13,449 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 733581303, now seen corresponding path program 1 times [2018-04-13 03:53:13,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:13,449 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:13,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,458 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:13,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:13,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:53:13,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 03:53:13,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 03:53:13,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 03:53:13,472 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-04-13 03:53:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:13,478 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-04-13 03:53:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 03:53:13,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-04-13 03:53:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:13,479 INFO L225 Difference]: With dead ends: 48 [2018-04-13 03:53:13,479 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 03:53:13,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:53:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 03:53:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 03:53:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 03:53:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-04-13 03:53:13,481 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-04-13 03:53:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:13,481 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-04-13 03:53:13,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 03:53:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-04-13 03:53:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:53:13,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:13,482 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:13,482 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2137199122, now seen corresponding path program 1 times [2018-04-13 03:53:13,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:13,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:13,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,493 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:13,496 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:13,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:13,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:13,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:13,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:13,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:13,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 03:53:13,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:13,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:13,572 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:53:13,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 03:53:13,600 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:53:13,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 03:53:13,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,609 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:53:13,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 03:53:13,623 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:53:13,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:13,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,641 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:53:13,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-13 03:53:13,747 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:53:13,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:53:13,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:53:13,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,755 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:53:13,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:13,763 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:53:13,763 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-13 03:53:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:13,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:13,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-13 03:53:13,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:53:13,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:53:13,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:53:13,786 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 14 states. [2018-04-13 03:53:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:14,049 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-04-13 03:53:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:53:14,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-13 03:53:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:14,050 INFO L225 Difference]: With dead ends: 69 [2018-04-13 03:53:14,050 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 03:53:14,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:53:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 03:53:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 03:53:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 03:53:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-04-13 03:53:14,052 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-04-13 03:53:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:14,052 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-04-13 03:53:14,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:53:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-04-13 03:53:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:53:14,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:14,053 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:14,053 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash -234540140, now seen corresponding path program 1 times [2018-04-13 03:53:14,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:14,053 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:14,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:14,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:14,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:14,065 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:14,068 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:14,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:14,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:14,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:14,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:14,116 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:53:14,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:14,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,131 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:53:14,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-13 03:53:14,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-04-13 03:53:14,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:53:14,302 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 25 treesize of output 21 [2018-04-13 03:53:14,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,318 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 15 treesize of output 8 [2018-04-13 03:53:14,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 03:53:14,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 10 [2018-04-13 03:53:14,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,348 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:53:14,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2018-04-13 03:53:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:14,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:53:14,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-13 03:53:14,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:53:14,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:53:14,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:53:14,383 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 14 states. [2018-04-13 03:53:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:14,701 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-04-13 03:53:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:53:14,701 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-13 03:53:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:14,702 INFO L225 Difference]: With dead ends: 68 [2018-04-13 03:53:14,702 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 03:53:14,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:53:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 03:53:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 03:53:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 03:53:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-04-13 03:53:14,704 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 33 [2018-04-13 03:53:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:14,704 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-04-13 03:53:14,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:53:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-04-13 03:53:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 03:53:14,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:14,705 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:14,705 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -172500526, now seen corresponding path program 1 times [2018-04-13 03:53:14,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:14,706 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:14,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:14,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:14,714 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:14,716 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:14,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:14,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:14,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:14,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:14,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:14,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:14,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 03:53:14,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:14,802 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:53:14,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:14,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:14,811 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:53:14,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 03:53:14,835 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:53:14,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:53:14,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-13 03:53:14,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 03:53:14,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:53:14,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,868 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:53:14,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 03:53:14,959 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:53:14,961 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 10 treesize of output 1 [2018-04-13 03:53:14,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:14,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:53:14,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:14,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:14,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:14,982 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:54 [2018-04-13 03:53:15,042 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:53:15,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:15,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:53:15,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:53:15,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:53:15,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:53:15,043 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 15 states. [2018-04-13 03:53:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:15,510 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-04-13 03:53:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:53:15,510 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-04-13 03:53:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:15,510 INFO L225 Difference]: With dead ends: 66 [2018-04-13 03:53:15,511 INFO L226 Difference]: Without dead ends: 66 [2018-04-13 03:53:15,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:53:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-13 03:53:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-04-13 03:53:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 03:53:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-13 03:53:15,513 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 33 [2018-04-13 03:53:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:15,513 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-13 03:53:15,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:53:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-13 03:53:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 03:53:15,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:15,514 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:15,514 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1052549015, now seen corresponding path program 1 times [2018-04-13 03:53:15,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:15,515 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:15,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:15,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:15,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:15,525 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:15,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:15,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:15,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:15,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:15,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:15,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:15,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:53:15,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:53:15,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:53:15,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:15,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:15,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:15,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 03:53:16,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-04-13 03:53:16,026 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 27 treesize of output 25 [2018-04-13 03:53:16,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:16,048 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 19 treesize of output 14 [2018-04-13 03:53:16,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 03:53:16,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-04-13 03:53:16,076 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:16,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 03:53:16,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:16,095 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:54 [2018-04-13 03:53:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:16,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:53:16,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-04-13 03:53:16,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:53:16,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:53:16,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:53:16,173 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 27 states. [2018-04-13 03:53:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:16,706 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-04-13 03:53:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:53:16,706 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-04-13 03:53:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:16,706 INFO L225 Difference]: With dead ends: 64 [2018-04-13 03:53:16,706 INFO L226 Difference]: Without dead ends: 60 [2018-04-13 03:53:16,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:53:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-13 03:53:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-04-13 03:53:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-13 03:53:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-04-13 03:53:16,709 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 34 [2018-04-13 03:53:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:16,709 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-04-13 03:53:16,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:53:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-04-13 03:53:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:53:16,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:16,710 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:16,710 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1148970598, now seen corresponding path program 2 times [2018-04-13 03:53:16,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:16,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:16,711 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:53:16,711 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:16,721 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:16,727 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:16,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:16,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:16,752 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:16,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:16,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:16,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:16,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:16,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:16,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:16,792 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:53:16,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:16,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:16,798 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:53:16,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 03:53:16,814 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:53:16,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:16,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-13 03:53:16,830 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 29 treesize of output 30 [2018-04-13 03:53:16,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:16,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,839 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:53:16,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-04-13 03:53:16,939 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 31 treesize of output 29 [2018-04-13 03:53:16,944 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:53:16,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:16,950 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 10 treesize of output 1 [2018-04-13 03:53:16,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:16,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:16,959 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:53:16,959 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-04-13 03:53:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:17,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:17,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:53:17,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:53:17,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:53:17,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:53:17,067 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 16 states. [2018-04-13 03:53:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:17,586 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-04-13 03:53:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:53:17,587 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-13 03:53:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:17,587 INFO L225 Difference]: With dead ends: 77 [2018-04-13 03:53:17,587 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 03:53:17,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:53:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 03:53:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-04-13 03:53:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 03:53:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-13 03:53:17,589 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 44 [2018-04-13 03:53:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:17,589 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-13 03:53:17,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:53:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-13 03:53:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 03:53:17,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:17,589 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:17,589 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1258350175, now seen corresponding path program 2 times [2018-04-13 03:53:17,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:17,589 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:17,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:17,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:17,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:17,597 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:17,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:17,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:17,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:53:17,863 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:53:17,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:17,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:17,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:17,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:17,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:17,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:53:17,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:53:17,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 03:53:17,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:17,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:17,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:17,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 03:53:18,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-04-13 03:53:18,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-04-13 03:53:18,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:18,058 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 18 treesize of output 13 [2018-04-13 03:53:18,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,060 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 15 treesize of output 8 [2018-04-13 03:53:18,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-04-13 03:53:18,076 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:18,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 03:53:18,091 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:53:18,091 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-04-13 03:53:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:53:18,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:53:18,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-04-13 03:53:18,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:53:18,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:53:18,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:53:18,148 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 26 states. [2018-04-13 03:53:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:18,489 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-04-13 03:53:18,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:53:18,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-04-13 03:53:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:18,490 INFO L225 Difference]: With dead ends: 75 [2018-04-13 03:53:18,490 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 03:53:18,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:53:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 03:53:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-04-13 03:53:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 03:53:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-04-13 03:53:18,492 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 45 [2018-04-13 03:53:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:18,492 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-04-13 03:53:18,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:53:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-04-13 03:53:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 03:53:18,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:18,493 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:18,493 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1488170194, now seen corresponding path program 3 times [2018-04-13 03:53:18,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:18,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:18,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:18,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:18,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:18,502 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:18,510 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:53:18,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:18,510 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:18,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:18,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:18,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:18,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:18,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 03:53:18,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:18,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 03:53:18,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:18,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 03:53:18,580 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:53:18,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,585 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:53:18,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 03:53:18,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 03:53:18,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,608 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:53:18,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 03:53:18,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,613 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:21 [2018-04-13 03:53:18,625 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 28 treesize of output 29 [2018-04-13 03:53:18,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:18,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,633 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:53:18,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 03:53:18,701 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 31 treesize of output 29 [2018-04-13 03:53:18,710 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:53:18,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:18,718 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 10 treesize of output 1 [2018-04-13 03:53:18,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:18,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:53:18,729 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:53:18,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-13 03:53:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-04-13 03:53:18,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:53:18,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 03:53:18,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:53:18,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:53:18,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:53:18,808 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 13 states. [2018-04-13 03:53:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:19,339 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-04-13 03:53:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:53:19,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-04-13 03:53:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:19,340 INFO L225 Difference]: With dead ends: 66 [2018-04-13 03:53:19,340 INFO L226 Difference]: Without dead ends: 66 [2018-04-13 03:53:19,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:53:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-13 03:53:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-04-13 03:53:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 03:53:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-04-13 03:53:19,342 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 55 [2018-04-13 03:53:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:19,342 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-04-13 03:53:19,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:53:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-04-13 03:53:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 03:53:19,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:53:19,342 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:53:19,342 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-04-13 03:53:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1111364247, now seen corresponding path program 3 times [2018-04-13 03:53:19,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:53:19,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:53:19,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:19,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:53:19,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:53:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:53:19,350 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:53:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-13 03:53:19,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:53:19,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:53:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:53:19,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:53:19,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:53:19,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:53:19,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:53:19,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 03:53:19,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:53:19,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:53:19,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-13 03:53:19,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-04-13 03:53:19,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-04-13 03:53:19,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:19,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 18 treesize of output 13 [2018-04-13 03:53:19,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,788 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 15 treesize of output 8 [2018-04-13 03:53:19,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 03:53:19,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-04-13 03:53:19,817 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 03:53:19,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 03:53:19,843 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:53:19,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-04-13 03:53:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-13 03:53:19,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:53:19,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-04-13 03:53:19,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:53:19,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:53:19,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:53:19,900 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 22 states. [2018-04-13 03:53:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:53:20,344 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-04-13 03:53:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:53:20,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-04-13 03:53:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:53:20,344 INFO L225 Difference]: With dead ends: 62 [2018-04-13 03:53:20,344 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 03:53:20,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1219, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:53:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 03:53:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 03:53:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 03:53:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 03:53:20,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-04-13 03:53:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:53:20,345 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 03:53:20,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:53:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 03:53:20,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 03:53:20,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 03:53:20 BoogieIcfgContainer [2018-04-13 03:53:20,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 03:53:20,348 INFO L168 Benchmark]: Toolchain (without parser) took 9385.38 ms. Allocated memory was 397.9 MB in the beginning and 793.2 MB in the end (delta: 395.3 MB). Free memory was 331.1 MB in the beginning and 511.8 MB in the end (delta: -180.6 MB). Peak memory consumption was 214.7 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:20,349 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 397.9 MB. Free memory is still 359.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 03:53:20,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.19 ms. Allocated memory is still 397.9 MB. Free memory was 331.1 MB in the beginning and 307.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:20,350 INFO L168 Benchmark]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 397.9 MB. Free memory was 307.4 MB in the beginning and 304.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:20,350 INFO L168 Benchmark]: RCFGBuilder took 394.00 ms. Allocated memory was 397.9 MB in the beginning and 604.0 MB in the end (delta: 206.0 MB). Free memory was 304.7 MB in the beginning and 537.9 MB in the end (delta: -233.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:20,350 INFO L168 Benchmark]: TraceAbstraction took 8685.97 ms. Allocated memory was 604.0 MB in the beginning and 793.2 MB in the end (delta: 189.3 MB). Free memory was 535.3 MB in the beginning and 511.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 212.8 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:20,351 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 397.9 MB. Free memory is still 359.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 263.19 ms. Allocated memory is still 397.9 MB. Free memory was 331.1 MB in the beginning and 307.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 397.9 MB. Free memory was 307.4 MB in the beginning and 304.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 394.00 ms. Allocated memory was 397.9 MB in the beginning and 604.0 MB in the end (delta: 206.0 MB). Free memory was 304.7 MB in the beginning and 537.9 MB in the end (delta: -233.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8685.97 ms. Allocated memory was 604.0 MB in the beginning and 793.2 MB in the end (delta: 189.3 MB). Free memory was 535.3 MB in the beginning and 511.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 212.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 67 locations, 15 error locations. SAFE Result, 8.6s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 864 SDtfs, 1102 SDslu, 3456 SDs, 0 SdLazy, 2925 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 288 SyntacticMatches, 11 SemanticMatches, 282 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 91 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 999 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 699 ConstructedInterpolants, 118 QuantifiedInterpolants, 373916 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1751 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 84/231 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_03-53-20-356.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_03-53-20-356.csv Received shutdown request...