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/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:07:02,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:07:02,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:07:02,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:07:02,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:07:02,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:07:02,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:07:02,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:07:02,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:07:02,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:07:02,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:07:02,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:07:02,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:07:02,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:07:02,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:07:02,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:07:02,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:07:02,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:07:02,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:07:02,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:07:02,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:07:02,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:07:02,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:07:02,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:07:02,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:07:02,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:07:02,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:07:02,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:07:02,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:07:02,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:07:02,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:07:02,488 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:07:02,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:07:02,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:07:02,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:07:02,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:07:02,512 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:07:02,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:07:02,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:07:02,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:07:02,514 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:07:02,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:07:02,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:07:02,514 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:07:02,514 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:07:02,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:07:02,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:07:02,515 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:07:02,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:07:02,515 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:07:02,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:07:02,556 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:07:02,559 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:07:02,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:07:02,561 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:07:02,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,846 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7f3d7a4ee [2018-04-11 15:07:02,976 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:07:02,976 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:07:02,977 INFO L168 CDTParser]: Scanning cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,984 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:07:02,984 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:07:02,985 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:07:02,985 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,985 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,985 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,985 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,985 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:07:02,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,988 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,989 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uint in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:02,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:03,009 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7f3d7a4ee [2018-04-11 15:07:03,011 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:07:03,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:07:03,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:07:03,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:07:03,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:07:03,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366f7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03, skipping insertion in model container [2018-04-11 15:07:03,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,034 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:07:03,055 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:07:03,198 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:07:03,234 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:07:03,239 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:07:03,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03 WrapperNode [2018-04-11 15:07:03,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:07:03,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:07:03,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:07:03,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:07:03,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... [2018-04-11 15:07:03,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:07:03,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:07:03,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:07:03,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:07:03,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:07:03,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:07:03,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:07:03,404 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:07:03,404 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:07:03,404 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-04-11 15:07:03,405 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:07:03,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:07:03,406 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:07:03,407 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:07:03,408 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:07:03,409 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:07:03,410 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:07:03,411 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:07:03,412 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:07:03,413 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:07:03,414 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:07:03,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:07:03,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:07:03,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:07:03,415 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:07:03,726 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:07:03,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:07:03 BoogieIcfgContainer [2018-04-11 15:07:03,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:07:03,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:07:03,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:07:03,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:07:03,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:07:03" (1/3) ... [2018-04-11 15:07:03,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf0f570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:07:03, skipping insertion in model container [2018-04-11 15:07:03,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:07:03" (2/3) ... [2018-04-11 15:07:03,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf0f570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:07:03, skipping insertion in model container [2018-04-11 15:07:03,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:07:03" (3/3) ... [2018-04-11 15:07:03,734 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:07:03,745 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:07:03,753 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 15:07:03,788 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:07:03,788 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:07:03,788 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:07:03,789 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:07:03,789 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:07:03,789 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:07:03,789 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:07:03,789 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:07:03,789 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:07:03,790 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:07:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-04-11 15:07:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:07:03,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:03,815 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:03,815 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 281371018, now seen corresponding path program 1 times [2018-04-11 15:07:03,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:03,820 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:03,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:03,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:03,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:03,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:03,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:03,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:07:03,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:07:03,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:07:03,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:07:03,940 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-04-11 15:07:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,004 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-04-11 15:07:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:07:04,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 15:07:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,014 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:07:04,014 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 15:07:04,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:07:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 15:07:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 15:07:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:07:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-11 15:07:04,046 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-04-11 15:07:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,046 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-11 15:07:04,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:07:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-11 15:07:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:07:04,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,047 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:04,047 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2051881253, now seen corresponding path program 1 times [2018-04-11 15:07:04,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,047 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:07:04,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:07:04,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:07:04,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:07:04,108 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-04-11 15:07:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,141 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-04-11 15:07:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:07:04,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 15:07:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,142 INFO L225 Difference]: With dead ends: 58 [2018-04-11 15:07:04,142 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 15:07:04,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:07:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 15:07:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 15:07:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:07:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-04-11 15:07:04,146 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-04-11 15:07:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,146 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-04-11 15:07:04,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:07:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-04-11 15:07:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:07:04,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,146 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:04,146 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1371822883, now seen corresponding path program 1 times [2018-04-11 15:07:04,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,147 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,163 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:04,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:04,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:04,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:04,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:04,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:07:04,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:07:04,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:07:04,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:07:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:07:04,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:07:04,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:07:04,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:07:04,258 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-04-11 15:07:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,310 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-11 15:07:04,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:07:04,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 15:07:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,311 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:07:04,311 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:07:04,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:07:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:07:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:07:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:07:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 15:07:04,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-04-11 15:07:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,314 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 15:07:04,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:07:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 15:07:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:07:04,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,314 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:04,314 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1371822882, now seen corresponding path program 1 times [2018-04-11 15:07:04,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,325 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:04,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:04,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:04,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:04,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:04,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:04,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 15:07:04,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:07:04,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:04,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:07:04,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-11 15:07:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:07:04,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:07:04,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:07:04,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:07:04,469 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-11 15:07:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,576 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-04-11 15:07:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:07:04,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-11 15:07:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,577 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:07:04,577 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:07:04,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:07:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:07:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-11 15:07:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:07:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-11 15:07:04,579 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-04-11 15:07:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,580 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-11 15:07:04,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:07:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-11 15:07:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:07:04,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,580 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:04,580 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash 423163648, now seen corresponding path program 1 times [2018-04-11 15:07:04,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,580 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:07:04,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:07:04,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:07:04,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:07:04,615 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-04-11 15:07:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,666 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-04-11 15:07:04,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:07:04,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 15:07:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,668 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:07:04,668 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:07:04,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:07:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:07:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 15:07:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:07:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 15:07:04,671 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-04-11 15:07:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,671 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 15:07:04,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:07:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 15:07:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:07:04,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,672 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:04,672 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash 423163649, now seen corresponding path program 1 times [2018-04-11 15:07:04,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,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-11 15:07:04,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:07:04,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:07:04,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:07:04,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:07:04,722 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-04-11 15:07:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,740 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-11 15:07:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:07:04,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 15:07:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,741 INFO L225 Difference]: With dead ends: 51 [2018-04-11 15:07:04,741 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:07:04,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:07:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:07:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:07:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:07:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 15:07:04,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-04-11 15:07:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,744 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 15:07:04,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:07:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 15:07:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:07:04,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,744 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:04,744 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1443369787, now seen corresponding path program 1 times [2018-04-11 15:07:04,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,745 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:07:04,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:07:04,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:07:04,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:07:04,781 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-04-11 15:07:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:04,827 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-11 15:07:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:07:04,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-11 15:07:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:04,828 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:07:04,828 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:07:04,828 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:07:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:07:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:07:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:07:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 15:07:04,832 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-04-11 15:07:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:04,832 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 15:07:04,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:07:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 15:07:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:07:04,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:04,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] [2018-04-11 15:07:04,833 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1443369788, now seen corresponding path program 1 times [2018-04-11 15:07:04,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:04,833 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:04,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:04,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:04,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:04,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:07:04,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:07:04,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:07:04,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:07:04,902 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-11 15:07:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:05,011 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-04-11 15:07:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:07:05,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-11 15:07:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:05,014 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:07:05,014 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:07:05,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:07:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:07:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-04-11 15:07:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:07:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-04-11 15:07:05,018 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-04-11 15:07:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:05,018 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-04-11 15:07:05,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:07:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-04-11 15:07:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:07:05,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:05,019 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:05,020 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1783256229, now seen corresponding path program 1 times [2018-04-11 15:07:05,020 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:05,020 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:05,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:05,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:05,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:05,040 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:05,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:05,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:05,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:05,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:05,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:05,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:07:05,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:05,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:05,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:05,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:07:05,120 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-11 15:07:05,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:07:05,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,129 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-11 15:07:05,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 15:07:05,148 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-11 15:07:05,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:07:05,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,166 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-11 15:07:05,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-04-11 15:07:05,217 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 27 treesize of output 25 [2018-04-11 15:07:05,219 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-11 15:07:05,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:05,229 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 13 treesize of output 10 [2018-04-11 15:07:05,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:05,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:05,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:05,241 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:46 [2018-04-11 15:07:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:05,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:05,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:07:05,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:07:05,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:07:05,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:07:05,300 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 13 states. [2018-04-11 15:07:09,534 WARN L148 SmtUtils]: Spent 4030ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 15:07:17,619 WARN L151 SmtUtils]: Spent 8070ms on a formula simplification. DAG size of input: 57 DAG size of output 56 [2018-04-11 15:07:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:19,943 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2018-04-11 15:07:19,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:07:19,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-04-11 15:07:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:19,945 INFO L225 Difference]: With dead ends: 146 [2018-04-11 15:07:19,945 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 15:07:19,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:07:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 15:07:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 102. [2018-04-11 15:07:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 15:07:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2018-04-11 15:07:19,956 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 23 [2018-04-11 15:07:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:19,957 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2018-04-11 15:07:19,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:07:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2018-04-11 15:07:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:07:19,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:19,957 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:19,958 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1231847389, now seen corresponding path program 1 times [2018-04-11 15:07:19,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:19,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:19,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:19,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:19,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:19,976 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:19,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:19,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:20,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:20,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:20,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:07:20,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:20,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:20,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:20,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 15:07:20,048 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 17 treesize of output 14 [2018-04-11 15:07:20,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:07:20,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,058 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-11 15:07:20,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2018-04-11 15:07:20,075 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-11 15:07:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:07:20,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 15:07:20,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:47 [2018-04-11 15:07:20,214 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-11 15:07:20,217 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-11 15:07:20,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:20,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:07:20,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:20,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:20,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:20,243 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:60, output treesize:58 [2018-04-11 15:07:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:20,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:20,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 15:07:20,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:07:20,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:07:20,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:07:20,298 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand 12 states. [2018-04-11 15:07:24,553 WARN L148 SmtUtils]: Spent 4016ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:07:26,741 WARN L151 SmtUtils]: Spent 2173ms on a formula simplification. DAG size of input: 64 DAG size of output 58 [2018-04-11 15:07:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:37,212 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2018-04-11 15:07:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:07:37,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-04-11 15:07:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:37,213 INFO L225 Difference]: With dead ends: 161 [2018-04-11 15:07:37,213 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 15:07:37,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:07:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 15:07:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 63. [2018-04-11 15:07:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:07:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-04-11 15:07:37,217 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 23 [2018-04-11 15:07:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:37,217 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2018-04-11 15:07:37,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:07:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-04-11 15:07:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:07:37,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:37,218 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:37,218 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash -18671751, now seen corresponding path program 1 times [2018-04-11 15:07:37,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:37,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:37,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:37,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:37,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:37,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:37,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:37,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:07:37,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:07:37,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:07:37,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:07:37,269 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 6 states. [2018-04-11 15:07:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:37,310 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-04-11 15:07:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:07:37,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 15:07:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:37,310 INFO L225 Difference]: With dead ends: 64 [2018-04-11 15:07:37,311 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 15:07:37,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:07:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 15:07:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-04-11 15:07:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 15:07:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-04-11 15:07:37,314 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 25 [2018-04-11 15:07:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:37,314 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-04-11 15:07:37,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:07:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-04-11 15:07:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:07:37,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:37,315 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:37,315 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash -18671750, now seen corresponding path program 1 times [2018-04-11 15:07:37,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:37,315 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:37,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:37,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:37,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:37,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:37,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:07:37,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:07:37,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:07:37,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:07:37,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:07:37,391 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 9 states. [2018-04-11 15:07:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:37,468 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-04-11 15:07:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:07:37,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-11 15:07:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:37,469 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:07:37,469 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:07:37,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:07:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:07:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2018-04-11 15:07:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:07:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-04-11 15:07:37,471 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 25 [2018-04-11 15:07:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:37,471 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-04-11 15:07:37,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:07:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-04-11 15:07:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:07:37,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:37,472 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:37,472 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -535876900, now seen corresponding path program 2 times [2018-04-11 15:07:37,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:37,472 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:37,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:37,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:37,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:37,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:37,487 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:37,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:37,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:07:37,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:07:37,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:37,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:37,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:37,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:37,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:07:37,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:37,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:07:37,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:37,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:37,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:37,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:07:37,585 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 19 treesize of output 16 [2018-04-11 15:07:37,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:07:37,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,596 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-11 15:07:37,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:07:37,611 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 32 treesize of output 33 [2018-04-11 15:07:37,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:07:37,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:07:37,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:07:37,721 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 35 treesize of output 33 [2018-04-11 15:07:37,725 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-11 15:07:37,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:37,736 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 19 treesize of output 16 [2018-04-11 15:07:37,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:37,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:37,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:37,749 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:35 [2018-04-11 15:07:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:37,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:37,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:07:37,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:07:37,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:07:37,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:07:37,818 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 15 states. [2018-04-11 15:07:42,011 WARN L148 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:07:46,126 WARN L151 SmtUtils]: Spent 4102ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-04-11 15:07:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:49,518 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2018-04-11 15:07:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:07:49,518 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-04-11 15:07:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:49,519 INFO L225 Difference]: With dead ends: 125 [2018-04-11 15:07:49,519 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 15:07:49,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:07:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 15:07:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 83. [2018-04-11 15:07:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:07:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-04-11 15:07:49,521 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 26 [2018-04-11 15:07:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:49,521 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-04-11 15:07:49,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:07:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2018-04-11 15:07:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:07:49,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:49,522 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:49,522 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash 84668347, now seen corresponding path program 3 times [2018-04-11 15:07:49,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:49,522 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:49,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:49,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:49,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:49,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:49,533 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:49,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:49,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:49,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:07:49,555 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:07:49,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:49,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:49,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:49,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:49,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:07:49,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:49,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:49,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:49,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:07:49,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:07:49,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:07:49,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:07:49,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 15:07:49,685 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-11 15:07:49,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:07:49,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,697 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-11 15:07:49,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-11 15:07:49,773 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-11 15:07:49,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 15:07:49,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:49,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:07:49,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:49,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:49,792 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-04-11 15:07:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:49,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:49,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:07:49,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:07:49,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:07:49,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:07:49,859 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 16 states. [2018-04-11 15:07:50,373 WARN L151 SmtUtils]: Spent 328ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-11 15:07:50,675 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 41 DAG size of output 37 [2018-04-11 15:07:51,265 WARN L151 SmtUtils]: Spent 577ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-04-11 15:07:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:52,265 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2018-04-11 15:07:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:07:52,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-04-11 15:07:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:52,266 INFO L225 Difference]: With dead ends: 225 [2018-04-11 15:07:52,266 INFO L226 Difference]: Without dead ends: 225 [2018-04-11 15:07:52,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:07:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-11 15:07:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2018-04-11 15:07:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 15:07:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2018-04-11 15:07:52,270 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 29 [2018-04-11 15:07:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:52,270 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2018-04-11 15:07:52,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:07:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2018-04-11 15:07:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:07:52,271 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:52,271 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:52,271 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:07:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 507370173, now seen corresponding path program 2 times [2018-04-11 15:07:52,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:52,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:52,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:52,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:52,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:52,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:52,291 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:52,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:52,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:52,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:07:52,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:07:52,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:52,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:52,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:52,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:52,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:07:52,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:52,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:07:52,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:52,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:52,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:52,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:07:52,381 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 19 treesize of output 16 [2018-04-11 15:07:52,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:07:52,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,390 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-11 15:07:52,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:07:52,430 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 32 treesize of output 33 [2018-04-11 15:07:52,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:07:52,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:07:52,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:07:52,581 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 45 treesize of output 41 [2018-04-11 15:07:52,583 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-11 15:07:52,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:52,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-11 15:07:52,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:52,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:52,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:07:52,619 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:72, output treesize:49 [2018-04-11 15:07:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:52,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:52,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:07:52,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:07:52,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:07:52,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:07:52,694 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand 17 states. [2018-04-11 15:07:56,923 WARN L148 SmtUtils]: Spent 4014ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:08:00,359 WARN L151 SmtUtils]: Spent 3416ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-04-11 15:08:04,487 WARN L148 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:08:10,698 WARN L151 SmtUtils]: Spent 4176ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-11 15:08:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:14,039 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2018-04-11 15:08:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:08:14,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-11 15:08:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:14,040 INFO L225 Difference]: With dead ends: 286 [2018-04-11 15:08:14,040 INFO L226 Difference]: Without dead ends: 286 [2018-04-11 15:08:14,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:08:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-11 15:08:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 196. [2018-04-11 15:08:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 15:08:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 259 transitions. [2018-04-11 15:08:14,047 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 259 transitions. Word has length 29 [2018-04-11 15:08:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:14,048 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 259 transitions. [2018-04-11 15:08:14,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:08:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 259 transitions. [2018-04-11 15:08:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:08:14,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:14,049 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:14,049 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -443531092, now seen corresponding path program 1 times [2018-04-11 15:08:14,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:14,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:14,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:14,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:14,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:14,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:14,068 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-11 15:08:14,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:08:14,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:08:14,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:08:14,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:08:14,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:08:14,069 INFO L87 Difference]: Start difference. First operand 196 states and 259 transitions. Second operand 3 states. [2018-04-11 15:08:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:14,073 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2018-04-11 15:08:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:08:14,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-11 15:08:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:14,074 INFO L225 Difference]: With dead ends: 184 [2018-04-11 15:08:14,075 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 15:08:14,075 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-11 15:08:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 15:08:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 85. [2018-04-11 15:08:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:08:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2018-04-11 15:08:14,077 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 30 [2018-04-11 15:08:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:14,077 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2018-04-11 15:08:14,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:08:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2018-04-11 15:08:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:08:14,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:14,078 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:14,078 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:14,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1208879740, now seen corresponding path program 4 times [2018-04-11 15:08:14,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:14,078 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:14,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:14,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:14,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:14,101 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:14,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:14,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:14,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:08:14,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:08:14,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:14,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:14,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:14,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:14,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:08:14,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:14,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:08:14,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:14,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:14,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:14,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:08:14,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:08:14,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:08:14,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:08:14,256 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-11 15:08:14,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:08:14,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,270 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-11 15:08:14,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 15:08:14,370 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-11 15:08:14,371 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-11 15:08:14,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:08:14,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:08:14,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:14,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:14,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-04-11 15:08:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:14,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:14,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:08:14,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:08:14,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:08:14,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:08:14,436 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 18 states. [2018-04-11 15:08:14,717 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-04-11 15:08:14,941 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-11 15:08:15,225 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 36 DAG size of output 32 [2018-04-11 15:08:15,386 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 36 DAG size of output 32 [2018-04-11 15:08:15,602 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-04-11 15:08:17,773 WARN L151 SmtUtils]: Spent 2147ms on a formula simplification. DAG size of input: 42 DAG size of output 36 [2018-04-11 15:08:18,053 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 51 DAG size of output 44 [2018-04-11 15:08:18,372 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 48 DAG size of output 39 [2018-04-11 15:08:18,845 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 43 DAG size of output 37 [2018-04-11 15:08:19,794 WARN L151 SmtUtils]: Spent 794ms on a formula simplification. DAG size of input: 56 DAG size of output 46 [2018-04-11 15:08:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:20,055 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2018-04-11 15:08:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:08:20,055 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-04-11 15:08:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:20,056 INFO L225 Difference]: With dead ends: 214 [2018-04-11 15:08:20,056 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:08:20,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:08:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:08:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2018-04-11 15:08:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 15:08:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-04-11 15:08:20,061 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 32 [2018-04-11 15:08:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:20,062 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-04-11 15:08:20,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:08:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2018-04-11 15:08:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:08:20,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:20,063 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] [2018-04-11 15:08:20,063 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash -751050763, now seen corresponding path program 1 times [2018-04-11 15:08:20,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:20,063 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:20,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:20,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:20,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:20,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:20,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:20,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:20,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:20,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:08:20,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-04-11 15:08:20,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:08:20,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:08:20,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:08:20,160 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 7 states. [2018-04-11 15:08:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:20,235 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2018-04-11 15:08:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:08:20,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-11 15:08:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:20,237 INFO L225 Difference]: With dead ends: 176 [2018-04-11 15:08:20,237 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 15:08:20,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:08:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 15:08:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2018-04-11 15:08:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:08:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2018-04-11 15:08:20,240 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 32 [2018-04-11 15:08:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:20,240 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2018-04-11 15:08:20,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:08:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2018-04-11 15:08:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:08:20,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:20,240 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:20,240 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1074866234, now seen corresponding path program 3 times [2018-04-11 15:08:20,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:20,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:20,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:20,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:20,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:20,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:20,258 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:20,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:20,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:20,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:08:20,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 15:08:20,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:20,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:20,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:20,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:20,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:08:20,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:20,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:08:20,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:20,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:20,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:20,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:08:20,375 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 19 treesize of output 16 [2018-04-11 15:08:20,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:08:20,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,386 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-11 15:08:20,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:08:20,401 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 32 treesize of output 33 [2018-04-11 15:08:20,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:08:20,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:08:20,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:08:20,611 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 50 treesize of output 44 [2018-04-11 15:08:20,612 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-11 15:08:20,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 62 [2018-04-11 15:08:20,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2018-04-11 15:08:20,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:20,663 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-11 15:08:20,663 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:88 [2018-04-11 15:08:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:20,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:20,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:08:20,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:08:20,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:08:20,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:08:20,752 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand 19 states. [2018-04-11 15:08:24,966 WARN L148 SmtUtils]: Spent 4022ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 15:08:29,007 WARN L148 SmtUtils]: Spent 4023ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 15:08:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:34,266 INFO L93 Difference]: Finished difference Result 281 states and 340 transitions. [2018-04-11 15:08:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:08:34,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-04-11 15:08:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:34,267 INFO L225 Difference]: With dead ends: 281 [2018-04-11 15:08:34,268 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 15:08:34,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:08:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 15:08:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 134. [2018-04-11 15:08:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 15:08:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2018-04-11 15:08:34,270 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 32 [2018-04-11 15:08:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:34,271 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2018-04-11 15:08:34,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:08:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2018-04-11 15:08:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:08:34,271 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:34,271 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] [2018-04-11 15:08:34,271 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash -885064269, now seen corresponding path program 1 times [2018-04-11 15:08:34,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:34,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:34,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:34,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:34,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:34,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:34,355 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-11 15:08:34,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:08:34,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:08:34,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:08:34,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:08:34,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:08:34,356 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand 11 states. [2018-04-11 15:08:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:34,481 INFO L93 Difference]: Finished difference Result 258 states and 305 transitions. [2018-04-11 15:08:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:08:34,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-04-11 15:08:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:34,481 INFO L225 Difference]: With dead ends: 258 [2018-04-11 15:08:34,482 INFO L226 Difference]: Without dead ends: 258 [2018-04-11 15:08:34,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:08:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-11 15:08:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2018-04-11 15:08:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 15:08:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 256 transitions. [2018-04-11 15:08:34,485 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 256 transitions. Word has length 32 [2018-04-11 15:08:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:34,485 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 256 transitions. [2018-04-11 15:08:34,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:08:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 256 transitions. [2018-04-11 15:08:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:08:34,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:34,485 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] [2018-04-11 15:08:34,485 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash -744515659, now seen corresponding path program 1 times [2018-04-11 15:08:34,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:34,486 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:34,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:34,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:34,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:34,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:34,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:34,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:34,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:34,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:34,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:34,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:34,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:34,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:08:34,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:08:34,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:08:34,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:34,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:34,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:34,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:08:34,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 15:08:34,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:08:34,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:08:34,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:34,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:34,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:08:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:34,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:08:34,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-11 15:08:34,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:08:34,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:08:34,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:08:34,959 INFO L87 Difference]: Start difference. First operand 210 states and 256 transitions. Second operand 23 states. [2018-04-11 15:08:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:35,668 INFO L93 Difference]: Finished difference Result 288 states and 347 transitions. [2018-04-11 15:08:35,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:08:35,668 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-04-11 15:08:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:35,669 INFO L225 Difference]: With dead ends: 288 [2018-04-11 15:08:35,669 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 15:08:35,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:08:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 15:08:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 220. [2018-04-11 15:08:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 15:08:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2018-04-11 15:08:35,673 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 32 [2018-04-11 15:08:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:35,674 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2018-04-11 15:08:35,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:08:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2018-04-11 15:08:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:08:35,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:35,674 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:35,675 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1745688551, now seen corresponding path program 1 times [2018-04-11 15:08:35,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:35,675 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:35,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:35,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:35,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:35,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:35,683 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:35,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:35,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:35,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:35,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:35,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:35,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:35,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:35,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:35,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:35,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 15:08:35,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:35,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:35,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:08:35,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:35,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:35,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:35,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:35,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:35,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:08:35,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 15:08:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:35,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:35,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:08:35,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:08:35,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:08:35,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:08:35,861 INFO L87 Difference]: Start difference. First operand 220 states and 269 transitions. Second operand 15 states. [2018-04-11 15:08:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:36,158 INFO L93 Difference]: Finished difference Result 283 states and 340 transitions. [2018-04-11 15:08:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:08:36,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-04-11 15:08:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:36,159 INFO L225 Difference]: With dead ends: 283 [2018-04-11 15:08:36,159 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 15:08:36,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:08:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 15:08:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2018-04-11 15:08:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 15:08:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 246 transitions. [2018-04-11 15:08:36,163 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 246 transitions. Word has length 33 [2018-04-11 15:08:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:36,163 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 246 transitions. [2018-04-11 15:08:36,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:08:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 246 transitions. [2018-04-11 15:08:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:08:36,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:36,163 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:36,163 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1605139941, now seen corresponding path program 1 times [2018-04-11 15:08:36,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:36,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:36,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:36,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:36,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:36,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:36,173 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:36,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:36,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:36,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:36,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:36,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:36,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:36,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 15:08:36,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:36,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:36,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:36,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:36,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:08:36,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:08:36,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-11 15:08:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:36,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:36,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:08:36,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:08:36,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:08:36,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:08:36,382 INFO L87 Difference]: Start difference. First operand 203 states and 246 transitions. Second operand 13 states. [2018-04-11 15:08:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:36,724 INFO L93 Difference]: Finished difference Result 337 states and 407 transitions. [2018-04-11 15:08:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:08:36,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-04-11 15:08:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:36,726 INFO L225 Difference]: With dead ends: 337 [2018-04-11 15:08:36,726 INFO L226 Difference]: Without dead ends: 337 [2018-04-11 15:08:36,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:08:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-11 15:08:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 203. [2018-04-11 15:08:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 15:08:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 246 transitions. [2018-04-11 15:08:36,731 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 246 transitions. Word has length 33 [2018-04-11 15:08:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:36,731 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 246 transitions. [2018-04-11 15:08:36,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:08:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 246 transitions. [2018-04-11 15:08:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:08:36,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:36,732 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:36,732 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:08:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1936224867, now seen corresponding path program 4 times [2018-04-11 15:08:36,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:36,733 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:36,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:36,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:36,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:36,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:36,757 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:36,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:36,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:36,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:08:36,784 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:08:36,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:36,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:36,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:36,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:36,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:08:36,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:36,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:08:36,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:36,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:36,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:36,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:08:36,867 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 19 treesize of output 16 [2018-04-11 15:08:36,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:08:36,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,880 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-11 15:08:36,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:08:36,899 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 32 treesize of output 33 [2018-04-11 15:08:36,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:08:36,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:36,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:08:36,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:08:37,488 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 61 treesize of output 53 [2018-04-11 15:08:37,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:37,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 117 [2018-04-11 15:08:37,521 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 15:08:37,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 36 xjuncts. [2018-04-11 15:08:37,648 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-11 15:08:37,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:37,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:37,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:08:37,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:98, output treesize:236 [2018-04-11 15:08:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:37,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:37,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:08:37,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:08:37,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:08:37,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:08:37,863 INFO L87 Difference]: Start difference. First operand 203 states and 246 transitions. Second operand 21 states. [2018-04-11 15:08:42,178 WARN L148 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:08:46,220 WARN L148 SmtUtils]: Spent 4023ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:08:50,362 WARN L148 SmtUtils]: Spent 4014ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:08:54,590 WARN L148 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-11 15:09:02,974 WARN L151 SmtUtils]: Spent 8036ms on a formula simplification. DAG size of input: 75 DAG size of output 64 [2018-04-11 15:09:13,291 WARN L151 SmtUtils]: Spent 8084ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-04-11 15:09:22,423 WARN L151 SmtUtils]: Spent 8038ms on a formula simplification. DAG size of input: 81 DAG size of output 70 [2018-04-11 15:09:32,775 WARN L151 SmtUtils]: Spent 8073ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-04-11 15:09:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:38,244 INFO L93 Difference]: Finished difference Result 589 states and 704 transitions. [2018-04-11 15:09:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:09:38,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-04-11 15:09:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:38,246 INFO L225 Difference]: With dead ends: 589 [2018-04-11 15:09:38,246 INFO L226 Difference]: Without dead ends: 589 [2018-04-11 15:09:38,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=185, Invalid=1147, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:09:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-11 15:09:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 209. [2018-04-11 15:09:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-11 15:09:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 254 transitions. [2018-04-11 15:09:38,256 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 254 transitions. Word has length 35 [2018-04-11 15:09:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:38,256 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 254 transitions. [2018-04-11 15:09:38,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:09:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 254 transitions. [2018-04-11 15:09:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:09:38,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:38,257 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:38,257 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:09:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1826876010, now seen corresponding path program 1 times [2018-04-11 15:09:38,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:38,257 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:38,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:38,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:38,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:38,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:38,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:38,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:09:38,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:09:38,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:09:38,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:38,298 INFO L87 Difference]: Start difference. First operand 209 states and 254 transitions. Second operand 6 states. [2018-04-11 15:09:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:38,340 INFO L93 Difference]: Finished difference Result 265 states and 316 transitions. [2018-04-11 15:09:38,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:09:38,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-11 15:09:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:38,343 INFO L225 Difference]: With dead ends: 265 [2018-04-11 15:09:38,343 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 15:09:38,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 15:09:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2018-04-11 15:09:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 15:09:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-04-11 15:09:38,347 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 36 [2018-04-11 15:09:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:38,348 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-04-11 15:09:38,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:09:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-04-11 15:09:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:09:38,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:38,348 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:38,348 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:09:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash -664270502, now seen corresponding path program 5 times [2018-04-11 15:09:38,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:38,349 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:38,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:38,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:38,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:38,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:38,381 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:38,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:38,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:38,382 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:09:38,416 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-11 15:09:38,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:38,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:38,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:38,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:38,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:09:38,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:38,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:09:38,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:38,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:09:38,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:09:38,511 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 19 treesize of output 16 [2018-04-11 15:09:38,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:09:38,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,521 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-11 15:09:38,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:09:38,537 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 32 treesize of output 33 [2018-04-11 15:09:38,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:09:38,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:09:38,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:09:38,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:09:38,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:38,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:09:38,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:67 [2018-04-11 15:09:39,050 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 66 treesize of output 56 [2018-04-11 15:09:39,051 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-11 15:09:39,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:39,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:39,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:39,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:39,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:39,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 92 [2018-04-11 15:09:39,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:39,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:39,117 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-11 15:09:39,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:83, output treesize:112 [2018-04-11 15:09:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:39,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:39,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:09:39,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:09:39,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:09:39,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:09:39,201 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 22 states. [2018-04-11 15:09:43,546 WARN L148 SmtUtils]: Spent 4034ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 15:09:47,890 WARN L148 SmtUtils]: Spent 4055ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:09:51,981 WARN L148 SmtUtils]: Spent 4037ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:09:56,161 WARN L148 SmtUtils]: Spent 4036ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:10:00,252 WARN L148 SmtUtils]: Spent 4025ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:10:05,886 WARN L148 SmtUtils]: Spent 4027ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-11 15:10:10,030 WARN L148 SmtUtils]: Spent 4031ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:10:14,200 WARN L148 SmtUtils]: Spent 4040ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-11 15:10:18,433 WARN L148 SmtUtils]: Spent 4039ms on a formula simplification that was a NOOP. DAG size: 63 [2018-04-11 15:10:27,031 WARN L151 SmtUtils]: Spent 8127ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-04-11 15:10:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:30,088 INFO L93 Difference]: Finished difference Result 467 states and 535 transitions. [2018-04-11 15:10:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:10:30,088 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-04-11 15:10:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:30,089 INFO L225 Difference]: With dead ends: 467 [2018-04-11 15:10:30,089 INFO L226 Difference]: Without dead ends: 463 [2018-04-11 15:10:30,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 45.7s TimeCoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:10:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-11 15:10:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 219. [2018-04-11 15:10:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 15:10:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 262 transitions. [2018-04-11 15:10:30,095 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 262 transitions. Word has length 38 [2018-04-11 15:10:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:30,095 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 262 transitions. [2018-04-11 15:10:30,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:10:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 262 transitions. [2018-04-11 15:10:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:10:30,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:30,096 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:30,096 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:10:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash -709485801, now seen corresponding path program 1 times [2018-04-11 15:10:30,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:30,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:30,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:30,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:30,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:30,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:30,108 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:30,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:30,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:30,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:30,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:30,154 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-11 15:10:30,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:30,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:10:30,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:30,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:10:30,219 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-11 15:10:30,233 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-11 15:10:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:30,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:30,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:10:30,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:10:30,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:10:30,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:10:30,239 INFO L87 Difference]: Start difference. First operand 219 states and 262 transitions. Second operand 8 states. [2018-04-11 15:10:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:30,356 INFO L93 Difference]: Finished difference Result 218 states and 261 transitions. [2018-04-11 15:10:30,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:10:30,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-04-11 15:10:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:30,357 INFO L225 Difference]: With dead ends: 218 [2018-04-11 15:10:30,357 INFO L226 Difference]: Without dead ends: 138 [2018-04-11 15:10:30,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:10:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-11 15:10:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2018-04-11 15:10:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 15:10:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-04-11 15:10:30,360 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 39 [2018-04-11 15:10:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:30,360 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-04-11 15:10:30,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:10:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-04-11 15:10:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:10:30,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:30,361 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:30,361 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:10:30,361 INFO L82 PathProgramCache]: Analyzing trace with hash -95111334, now seen corresponding path program 2 times [2018-04-11 15:10:30,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:30,361 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:30,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:30,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:30,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:30,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:30,387 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:30,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:30,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:30,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:30,410 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:30,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:30,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:30,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:30,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:10:30,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:30,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:30,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:30,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:30,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:10:30,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:10:30,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:30,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:10:30,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:10:30,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:10:30,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:30,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-11 15:10:30,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:10:30,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:10:30,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:30,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:30,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:30,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 15:10:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:30,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:30,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:10:30,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:10:30,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:10:30,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:10:30,790 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 18 states. [2018-04-11 15:10:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:31,246 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-04-11 15:10:31,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:10:31,246 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-11 15:10:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:31,247 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:10:31,247 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:10:31,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:10:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:10:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2018-04-11 15:10:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 15:10:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2018-04-11 15:10:31,249 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 39 [2018-04-11 15:10:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:31,249 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2018-04-11 15:10:31,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:10:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2018-04-11 15:10:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:10:31,250 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:31,250 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:31,250 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:10:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1346524950, now seen corresponding path program 2 times [2018-04-11 15:10:31,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:31,250 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:31,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:31,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:31,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:31,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:31,263 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:31,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:31,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:31,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:31,275 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:31,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:31,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:31,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:31,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:31,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:10:31,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:31,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-11 15:10:31,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:31,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:31,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:31,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 15:10:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:31,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:31,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:10:31,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:10:31,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:10:31,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:10:31,523 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 18 states. [2018-04-11 15:10:32,044 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 46 DAG size of output 39 [2018-04-11 15:10:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:32,160 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-04-11 15:10:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:10:32,160 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-04-11 15:10:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:32,160 INFO L225 Difference]: With dead ends: 168 [2018-04-11 15:10:32,160 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 15:10:32,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:10:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 15:10:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2018-04-11 15:10:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 15:10:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-04-11 15:10:32,163 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 40 [2018-04-11 15:10:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:32,163 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-04-11 15:10:32,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:10:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-04-11 15:10:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:10:32,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:32,164 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:32,164 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:10:32,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1346515914, now seen corresponding path program 1 times [2018-04-11 15:10:32,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:32,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:32,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:32,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:32,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:32,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:32,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:32,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:32,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:32,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:32,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:32,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:32,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:32,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:32,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:32,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:10:32,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:32,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:32,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:32,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:32,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:32,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:32,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:32,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-11 15:10:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:32,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:10:32,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-11 15:10:32,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:10:32,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:10:32,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:10:32,837 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 33 states. [2018-04-11 15:10:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:33,555 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2018-04-11 15:10:33,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:10:33,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-04-11 15:10:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:33,556 INFO L225 Difference]: With dead ends: 177 [2018-04-11 15:10:33,556 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 15:10:33,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:10:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 15:10:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2018-04-11 15:10:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 15:10:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2018-04-11 15:10:33,559 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 40 [2018-04-11 15:10:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:33,559 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2018-04-11 15:10:33,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:10:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2018-04-11 15:10:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:10:33,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:33,560 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:33,560 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-11 15:10:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1926731901, now seen corresponding path program 6 times [2018-04-11 15:10:33,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:33,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:33,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:33,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:33,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:33,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:33,593 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:33,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:33,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:33,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:33,620 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-11 15:10:33,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:33,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:33,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:33,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:33,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:10:33,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:33,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:33,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:33,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:33,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:10:33,705 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 19 treesize of output 16 [2018-04-11 15:10:33,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:10:33,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,713 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-11 15:10:33,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:10:33,726 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 32 treesize of output 33 [2018-04-11 15:10:33,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:33,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:33,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:10:33,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:10:33,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:33,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:67 [2018-04-11 15:10:34,482 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:10:34,488 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 74 treesize of output 62 [2018-04-11 15:10:34,490 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-11 15:10:34,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:34,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 203 [2018-04-11 15:10:34,568 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-04-11 15:10:34,754 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 32768 conjuctions. This might take some time... Received shutdown request... [2018-04-11 15:10:36,187 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 15:10:36,187 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:10:36,190 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:10:36,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:10:36 BoogieIcfgContainer [2018-04-11 15:10:36,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:10:36,191 INFO L168 Benchmark]: Toolchain (without parser) took 213178.82 ms. Allocated memory was 401.1 MB in the beginning and 690.5 MB in the end (delta: 289.4 MB). Free memory was 333.5 MB in the beginning and 417.7 MB in the end (delta: -84.2 MB). Peak memory consumption was 216.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:10:36,191 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 401.1 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:10:36,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.31 ms. Allocated memory is still 401.1 MB. Free memory was 331.7 MB in the beginning and 307.3 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:10:36,192 INFO L168 Benchmark]: Boogie Preprocessor took 37.41 ms. Allocated memory is still 401.1 MB. Free memory was 307.3 MB in the beginning and 304.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:10:36,192 INFO L168 Benchmark]: RCFGBuilder took 420.33 ms. Allocated memory was 401.1 MB in the beginning and 612.9 MB in the end (delta: 211.8 MB). Free memory was 304.6 MB in the beginning and 545.8 MB in the end (delta: -241.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:10:36,192 INFO L168 Benchmark]: TraceAbstraction took 212462.19 ms. Allocated memory was 612.9 MB in the beginning and 690.5 MB in the end (delta: 77.6 MB). Free memory was 545.8 MB in the beginning and 417.7 MB in the end (delta: 128.1 MB). Peak memory consumption was 216.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:10:36,193 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 401.1 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 256.31 ms. Allocated memory is still 401.1 MB. Free memory was 331.7 MB in the beginning and 307.3 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.41 ms. Allocated memory is still 401.1 MB. Free memory was 307.3 MB in the beginning and 304.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 420.33 ms. Allocated memory was 401.1 MB in the beginning and 612.9 MB in the end (delta: 211.8 MB). Free memory was 304.6 MB in the beginning and 545.8 MB in the end (delta: -241.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 212462.19 ms. Allocated memory was 612.9 MB in the beginning and 690.5 MB in the end (delta: 77.6 MB). Free memory was 545.8 MB in the beginning and 417.7 MB in the end (delta: 128.1 MB). Peak memory consumption was 216.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 15 error locations. TIMEOUT Result, 212.4s OverallTime, 31 OverallIterations, 8 TraceHistogramMax, 201.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1421 SDtfs, 2860 SDslu, 8226 SDs, 0 SdLazy, 7775 SolverSat, 723 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 47.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 885 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 530 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2798 ImplicationChecksByTransitivity, 158.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1763 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1414 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 902 ConstructedInterpolants, 163 QuantifiedInterpolants, 395089 SizeOfPredicates, 220 NumberOfNonLiveVariables, 2743 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 20/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-10-36-198.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-10-36-198.csv Completed graceful shutdown