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/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:06:29,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:06:29,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:06:29,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:06:29,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:06:29,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:06:29,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:06:29,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:06:29,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:06:29,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:06:29,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:06:29,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:06:29,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:06:29,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:06:29,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:06:29,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:06:29,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:06:29,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:06:29,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:06:29,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:06:29,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:06:29,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:06:29,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:06:29,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:06:29,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:06:29,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:06:29,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:06:29,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:06:29,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:06:29,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:06:29,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:06:29,538 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:06:29,557 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:06:29,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:06:29,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:06:29,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:06:29,558 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:06:29,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:06:29,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:06:29,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:06:29,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:06:29,560 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:06:29,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:06:29,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:06:29,560 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:06:29,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:06:29,560 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:06:29,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:06:29,596 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:06:29,599 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:06:29,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:06:29,601 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:06:29,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:29,892 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfe3a1579d [2018-04-11 15:06:30,024 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:06:30,024 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:06:30,025 INFO L168 CDTParser]: Scanning cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,029 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:06:30,030 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:06:30,030 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:06:30,030 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:06:30,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__off_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____time_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_short in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__key_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____u_short in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____u_int in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__uint in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,032 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__id_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__ushort in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____key_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__time_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__register_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,033 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____u_long in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,034 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__ulong in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_long in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____off_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____id_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,035 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____u_char in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__div_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__size_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,036 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__u_char in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,037 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,049 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfe3a1579d [2018-04-11 15:06:30,052 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:06:30,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:06:30,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:06:30,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:06:30,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:06:30,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d2e2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30, skipping insertion in model container [2018-04-11 15:06:30,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,070 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:06:30,088 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:06:30,212 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:06:30,246 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:06:30,251 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:06:30,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30 WrapperNode [2018-04-11 15:06:30,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:06:30,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:06:30,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:06:30,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:06:30,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (1/1) ... [2018-04-11 15:06:30,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:06:30,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:06:30,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:06:30,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:06:30,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (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:06:30,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:06:30,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:06:30,417 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:06:30,417 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:06:30,417 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-04-11 15:06:30,417 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:06:30,417 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:06:30,417 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:06:30,417 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:06:30,418 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:06:30,419 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:06:30,420 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:06:30,421 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:06:30,422 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:06:30,423 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:06:30,424 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:06:30,425 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:06:30,426 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:06:30,427 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:06:30,428 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:06:30,429 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:06:30,429 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:06:30,429 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:06:30,429 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:06:30,683 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:06:30,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:06:30 BoogieIcfgContainer [2018-04-11 15:06:30,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:06:30,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:06:30,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:06:30,685 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:06:30,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:06:30" (1/3) ... [2018-04-11 15:06:30,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@becdb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:06:30, skipping insertion in model container [2018-04-11 15:06:30,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:06:30" (2/3) ... [2018-04-11 15:06:30,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@becdb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:06:30, skipping insertion in model container [2018-04-11 15:06:30,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:06:30" (3/3) ... [2018-04-11 15:06:30,687 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:06:30,694 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:06:30,704 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-04-11 15:06:30,731 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:06:30,731 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:06:30,731 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:06:30,731 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:06:30,731 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:06:30,731 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:06:30,731 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:06:30,731 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:06:30,731 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:06:30,732 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:06:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-04-11 15:06:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:06:30,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:30,744 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:30,744 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash -320034324, now seen corresponding path program 1 times [2018-04-11 15:06:30,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:30,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:30,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:30,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:30,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:30,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:30,843 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:06:30,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:30,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:06:30,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:06:30,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:06:30,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:06:30,860 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-04-11 15:06:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:30,903 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-11 15:06:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:06:30,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-11 15:06:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:30,910 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:06:30,910 INFO L226 Difference]: Without dead ends: 40 [2018-04-11 15:06:30,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:06:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-11 15:06:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-04-11 15:06:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-11 15:06:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-11 15:06:30,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-04-11 15:06:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:30,933 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-11 15:06:30,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:06:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-11 15:06:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:06:30,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:30,934 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:30,934 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash -320032402, now seen corresponding path program 1 times [2018-04-11 15:06:30,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:30,934 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:30,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:30,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:30,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:30,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:30,965 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:06:30,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:30,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:06:30,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:06:30,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:06:30,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:06:30,966 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-04-11 15:06:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:30,983 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-04-11 15:06:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:06:30,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-04-11 15:06:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:30,984 INFO L225 Difference]: With dead ends: 39 [2018-04-11 15:06:30,984 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:06:30,984 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:06:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:06:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-04-11 15:06:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-11 15:06:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-11 15:06:30,987 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-04-11 15:06:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:30,987 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-11 15:06:30,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:06:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-11 15:06:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:06:30,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:30,987 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:30,988 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash -227374400, now seen corresponding path program 1 times [2018-04-11 15:06:30,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:30,988 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:30,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:30,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:30,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:31,024 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:06:31,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:31,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:06:31,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:06:31,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:06:31,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:06:31,025 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-04-11 15:06:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:31,067 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-04-11 15:06:31,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:06:31,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:06:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:31,068 INFO L225 Difference]: With dead ends: 36 [2018-04-11 15:06:31,068 INFO L226 Difference]: Without dead ends: 36 [2018-04-11 15:06:31,068 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:06:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-11 15:06:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-11 15:06:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:06:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:06:31,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-04-11 15:06:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:31,071 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:06:31,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:06:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:06:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:06:31,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:31,071 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:31,071 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash -227374399, now seen corresponding path program 1 times [2018-04-11 15:06:31,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:31,072 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:31,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:31,125 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:06:31,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:31,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:06:31,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:06:31,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:06:31,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:06:31,125 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-04-11 15:06:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:31,154 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-11 15:06:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:06:31,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:06:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:31,155 INFO L225 Difference]: With dead ends: 35 [2018-04-11 15:06:31,155 INFO L226 Difference]: Without dead ends: 35 [2018-04-11 15:06:31,155 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:06:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-11 15:06:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-11 15:06:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-11 15:06:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-11 15:06:31,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-04-11 15:06:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:31,158 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-11 15:06:31,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:06:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-11 15:06:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:06:31,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:31,159 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:31,159 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1962457945, now seen corresponding path program 1 times [2018-04-11 15:06:31,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:31,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:31,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:31,209 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:06:31,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:31,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:06:31,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:06:31,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:06:31,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:06:31,210 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-04-11 15:06:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:31,261 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-04-11 15:06:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:06:31,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-11 15:06:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:31,261 INFO L225 Difference]: With dead ends: 34 [2018-04-11 15:06:31,262 INFO L226 Difference]: Without dead ends: 34 [2018-04-11 15:06:31,262 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:06:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-04-11 15:06:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-04-11 15:06:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-04-11 15:06:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-04-11 15:06:31,264 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-04-11 15:06:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:31,264 INFO L459 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-04-11 15:06:31,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:06:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-04-11 15:06:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:06:31,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:31,265 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:31,265 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1962457944, now seen corresponding path program 1 times [2018-04-11 15:06:31,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:31,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:31,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,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:06:31,355 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:06:31,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:31,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:06:31,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:06:31,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:06:31,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:06:31,367 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-04-11 15:06:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:31,439 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-04-11 15:06:31,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:06:31,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-11 15:06:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:31,440 INFO L225 Difference]: With dead ends: 41 [2018-04-11 15:06:31,440 INFO L226 Difference]: Without dead ends: 41 [2018-04-11 15:06:31,441 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:06:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-11 15:06:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-04-11 15:06:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-11 15:06:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-11 15:06:31,442 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-04-11 15:06:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:31,443 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-11 15:06:31,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:06:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-11 15:06:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:06:31,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:31,443 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:06:31,443 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash -706654171, now seen corresponding path program 1 times [2018-04-11 15:06:31,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:31,443 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:31,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:31,465 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:31,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:31,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:31,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:31,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:31,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:06:31,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:06:31,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,533 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:06:31,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:06:31,550 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:06:31,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:31,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:06:31,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:06:31,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:06:31,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:06:31,551 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 7 states. [2018-04-11 15:06:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:31,604 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-04-11 15:06:31,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:06:31,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-11 15:06:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:31,604 INFO L225 Difference]: With dead ends: 36 [2018-04-11 15:06:31,605 INFO L226 Difference]: Without dead ends: 36 [2018-04-11 15:06:31,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:06:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-11 15:06:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-11 15:06:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:06:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:06:31,606 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-04-11 15:06:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:31,607 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:06:31,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:06:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:06:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:06:31,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:31,607 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:06:31,607 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash -706654170, now seen corresponding path program 1 times [2018-04-11 15:06:31,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:31,607 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:31,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:31,619 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:31,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:31,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:31,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:31,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:31,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:31,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:31,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:06:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:31,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:31,701 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:06:31,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:06:31,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:31,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:06:31,835 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:06:31,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:31,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:06:31,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:06:31,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:06:31,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:06:31,836 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 13 states. [2018-04-11 15:06:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:32,164 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-04-11 15:06:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:06:32,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-04-11 15:06:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:32,165 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:06:32,165 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:06:32,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:06:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:06:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-11 15:06:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:06:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-04-11 15:06:32,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 20 [2018-04-11 15:06:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:32,170 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-04-11 15:06:32,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:06:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-04-11 15:06:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:06:32,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:32,174 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:06:32,174 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1293460184, now seen corresponding path program 1 times [2018-04-11 15:06:32,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:32,174 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:32,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:32,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:32,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:32,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:32,187 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:32,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:32,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:32,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:32,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:32,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:32,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:32,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,223 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:06:32,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:32,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:32,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:32,238 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:06:32,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,244 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:06:32,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:06:32,274 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:06:32,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:32,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:06:32,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:06:32,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:06:32,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:06:32,275 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 9 states. [2018-04-11 15:06:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:32,368 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-04-11 15:06:32,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:06:32,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-04-11 15:06:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:32,371 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:06:32,371 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:06:32,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:06:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:06:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2018-04-11 15:06:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-11 15:06:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-11 15:06:32,374 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-04-11 15:06:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:32,374 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-11 15:06:32,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:06:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-11 15:06:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:06:32,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:32,379 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:32,379 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1723623482, now seen corresponding path program 1 times [2018-04-11 15:06:32,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:32,379 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:32,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:32,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:32,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:32,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:32,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:32,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:06:32,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:06:32,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:06:32,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:06:32,448 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-04-11 15:06:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:32,521 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-04-11 15:06:32,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:06:32,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-11 15:06:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:32,521 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:06:32,521 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 15:06:32,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:06:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 15:06:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-04-11 15:06:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:06:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-04-11 15:06:32,524 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-04-11 15:06:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:32,525 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-04-11 15:06:32,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:06:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-04-11 15:06:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:06:32,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:32,525 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:32,526 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 135275580, now seen corresponding path program 1 times [2018-04-11 15:06:32,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:32,526 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:32,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:32,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:32,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:32,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:32,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:32,692 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:32,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:32,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:32,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:06:32,749 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:06:32,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:32,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:32,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:06:32,836 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:06:32,841 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:06:32,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:32,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:32,852 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:06:32,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:06:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:32,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:06:32,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-11 15:06:32,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:06:32,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:06:32,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:06:32,932 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2018-04-11 15:06:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:33,264 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-11 15:06:33,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:06:33,264 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-04-11 15:06:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:33,265 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:06:33,265 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 15:06:33,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:06:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 15:06:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-04-11 15:06:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:06:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-04-11 15:06:33,269 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-04-11 15:06:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:33,270 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-04-11 15:06:33,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:06:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-04-11 15:06:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:06:33,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:33,270 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] [2018-04-11 15:06:33,271 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:33,271 INFO L82 PathProgramCache]: Analyzing trace with hash -101424366, now seen corresponding path program 1 times [2018-04-11 15:06:33,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:33,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:33,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:33,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:33,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:33,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:33,290 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:33,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:33,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:33,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:33,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:33,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:33,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:33,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:33,350 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:06:33,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:06:33,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:33,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:06:33,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:33,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:33,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:33,399 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:06:33,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:33,408 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:06:33,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:06:33,586 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:06:33,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:33,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:06:33,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:06:33,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:06:33,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:06:33,587 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 16 states. [2018-04-11 15:06:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:33,985 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-04-11 15:06:33,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:06:33,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-04-11 15:06:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:33,985 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:06:33,985 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:06:33,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:06:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:06:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-04-11 15:06:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:06:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-11 15:06:33,989 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 25 [2018-04-11 15:06:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:33,989 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-11 15:06:33,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:06:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-11 15:06:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:06:33,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:33,990 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:33,990 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1408509222, now seen corresponding path program 2 times [2018-04-11 15:06:33,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:33,990 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:33,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:33,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:34,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:34,033 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:34,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:34,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:34,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:06:34,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:06:34,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:34,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:34,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:34,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:06:34,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:34,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:34,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:34,101 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:06:34,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:06:34,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 16 treesize of output 13 [2018-04-11 15:06:34,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 13 treesize of output 12 [2018-04-11 15:06:34,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:06:34,217 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:06:34,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:34,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,229 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:06:34,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-04-11 15:06:34,262 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:06:34,268 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:06:34,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:34,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:34,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:34,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:38 [2018-04-11 15:06:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:34,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:34,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:06:34,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:06:34,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:06:34,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:06:34,345 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 16 states. [2018-04-11 15:06:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:34,672 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-11 15:06:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:06:34,672 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-04-11 15:06:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:34,672 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:06:34,672 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 15:06:34,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:06:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 15:06:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-04-11 15:06:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 15:06:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-04-11 15:06:34,676 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 29 [2018-04-11 15:06:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:34,677 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-04-11 15:06:34,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:06:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-04-11 15:06:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:06:34,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:34,678 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] [2018-04-11 15:06:34,678 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:34,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1243632953, now seen corresponding path program 1 times [2018-04-11 15:06:34,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:34,678 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:34,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:34,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:34,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:34,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:34,690 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:34,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:34,690 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:34,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:34,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:34,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 15:06:34,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 15:06:34,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,770 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:06:34,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:06:34,796 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= (store (store .cse0 |c_main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |c_#valid|) (= (select .cse0 |c_main_#t~malloc8.base|) 0)))) is different from true [2018-04-11 15:06:34,800 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc8.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |main_#t~malloc8.base| 0)) (= (select .cse0 |main_#t~malloc8.base|) 0)))) is different from true [2018-04-11 15:06:34,803 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:06:34,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:06:34,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:06:34,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:06:34,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:06:34,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:06:34,804 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 8 states. [2018-04-11 15:06:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:34,860 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-04-11 15:06:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:06:34,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-11 15:06:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:34,861 INFO L225 Difference]: With dead ends: 61 [2018-04-11 15:06:34,861 INFO L226 Difference]: Without dead ends: 36 [2018-04-11 15:06:34,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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:06:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-11 15:06:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-11 15:06:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:06:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-04-11 15:06:34,864 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-04-11 15:06:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:34,864 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-04-11 15:06:34,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:06:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-04-11 15:06:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:06:34,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:34,865 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:34,865 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash 714112872, now seen corresponding path program 2 times [2018-04-11 15:06:34,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:34,865 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:34,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:34,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:34,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:34,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:34,880 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:34,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:34,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:06:34,912 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:06:34,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:34,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:34,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:34,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:34,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,931 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:06:34,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:34,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:34,947 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:06:34,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:34,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:34,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:06:34,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:34,959 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:06:34,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:06:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:35,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:35,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:06:35,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:06:35,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:06:35,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:06:35,158 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 15 states. [2018-04-11 15:06:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:35,493 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-04-11 15:06:35,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:06:35,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-04-11 15:06:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:35,494 INFO L225 Difference]: With dead ends: 38 [2018-04-11 15:06:35,494 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:06:35,494 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:06:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:06:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-04-11 15:06:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-11 15:06:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-04-11 15:06:35,496 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2018-04-11 15:06:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:35,496 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-04-11 15:06:35,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:06:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-04-11 15:06:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:06:35,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:35,496 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:35,496 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1709057660, now seen corresponding path program 3 times [2018-04-11 15:06:35,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:35,496 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:35,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:35,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:35,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:35,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:35,517 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:35,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:35,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:35,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:06:35,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:06:35,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:35,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:35,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:35,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:06:35,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:35,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:35,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:35,594 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:06:35,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:06:35,619 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:06:35,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:06:35,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:06:35,690 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:06:35,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:06:35,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-04-11 15:06:35,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-11 15:06:35,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 15:06:35,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-04-11 15:06:35,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:35,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:35,798 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:06:35,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2018-04-11 15:06:35,835 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 15:06:35,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:35,840 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:06:35,844 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:06:35,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:35,847 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:35,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:35,851 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:36 [2018-04-11 15:06:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:35,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:35,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:06:35,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:06:35,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:06:35,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:06:35,904 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-04-11 15:06:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:36,302 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-11 15:06:36,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:06:36,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-11 15:06:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:36,303 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:06:36,303 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:06:36,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:06:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:06:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-04-11 15:06:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-11 15:06:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-04-11 15:06:36,305 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2018-04-11 15:06:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:36,305 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-04-11 15:06:36,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:06:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-04-11 15:06:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:06:36,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:36,306 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:36,306 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1441179858, now seen corresponding path program 3 times [2018-04-11 15:06:36,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:36,306 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:36,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:36,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:36,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:36,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:36,321 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:36,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:36,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:36,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:06:36,341 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:06:36,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:36,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:36,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:36,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:06:36,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:06:36,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:36,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:06:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:36,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:36,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:06:36,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:06:36,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:06:36,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:06:36,554 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2018-04-11 15:06:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:36,849 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-04-11 15:06:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:06:36,849 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-11 15:06:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:36,850 INFO L225 Difference]: With dead ends: 43 [2018-04-11 15:06:36,850 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 15:06:36,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:06:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 15:06:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-04-11 15:06:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-11 15:06:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-04-11 15:06:36,851 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-04-11 15:06:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:36,851 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-04-11 15:06:36,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:06:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-04-11 15:06:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:06:36,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:36,852 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:36,852 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:36,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1036880614, now seen corresponding path program 4 times [2018-04-11 15:06:36,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:36,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:36,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:36,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:36,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:36,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:36,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:36,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:36,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:06:36,915 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:06:36,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:36,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:36,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:36,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:06:36,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:36,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:36,975 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:06:36,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:36,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:36,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:06:36,999 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:06:37,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:37,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:06:37,095 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:06:37,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:37,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 15:06:37,133 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:06:37,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 8 treesize of output 7 [2018-04-11 15:06:37,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 15:06:37,172 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:06:37,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:37,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-04-11 15:06:37,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:06:37,211 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:06:37,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:37,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:37,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:37,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-11 15:06:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:37,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:37,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:06:37,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:06:37,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:06:37,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:06:37,263 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 20 states. [2018-04-11 15:06:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:37,607 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-04-11 15:06:37,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:06:37,607 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-04-11 15:06:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:37,608 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:06:37,608 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:06:37,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:06:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:06:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-04-11 15:06:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 15:06:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-04-11 15:06:37,610 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2018-04-11 15:06:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:37,610 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-04-11 15:06:37,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:06:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-04-11 15:06:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:06:37,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:37,611 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:37,611 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2078527912, now seen corresponding path program 4 times [2018-04-11 15:06:37,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:37,611 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:37,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:37,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:37,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:37,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:37,682 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:37,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:37,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:06:37,709 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:06:37,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:37,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:37,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:37,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,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 6 treesize of output 5 [2018-04-11 15:06:37,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:37,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:37,753 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:06:37,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:37,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:37,769 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:06:37,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:37,776 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:06:37,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:06:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:37,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:37,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:06:37,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:06:37,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:06:37,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:06:37,961 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2018-04-11 15:06:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:38,443 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-04-11 15:06:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:06:38,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-11 15:06:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:38,444 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:06:38,444 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:06:38,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:06:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:06:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-04-11 15:06:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:06:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-04-11 15:06:38,446 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 40 [2018-04-11 15:06:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:38,447 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-04-11 15:06:38,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:06:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-04-11 15:06:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:06:38,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:38,447 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:38,447 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1555978428, now seen corresponding path program 5 times [2018-04-11 15:06:38,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:38,448 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:38,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:38,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:38,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:38,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:38,479 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:38,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:38,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:06:38,527 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:06:38,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:38,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:38,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:38,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:06:38,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:38,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:38,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:06:38,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:38,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:06:38,594 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:06:38,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:38,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-11 15:06:38,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:06:38,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:38,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 15:06:38,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:06:38,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-04-11 15:06:38,750 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:06:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:38,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:06:38,781 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:06:38,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:06:38,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:06:38,841 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:06:38,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:06:38,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:38,853 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:06:38,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 15:06:38,888 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:06:38,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:06:38,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:38,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:38,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:06:38,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 15:06:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:38,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:38,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:06:38,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:06:38,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:06:38,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:06:38,969 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 22 states. [2018-04-11 15:06:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:39,576 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-04-11 15:06:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:06:39,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-04-11 15:06:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:39,576 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:06:39,576 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:06:39,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:06:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:06:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-04-11 15:06:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 15:06:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-04-11 15:06:39,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-04-11 15:06:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:39,584 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-04-11 15:06:39,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:06:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-04-11 15:06:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:06:39,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:39,584 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:39,584 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash 990690962, now seen corresponding path program 5 times [2018-04-11 15:06:39,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:39,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:39,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:39,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:39,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:39,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:39,625 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:39,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:39,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:06:39,682 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:06:39,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:39,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:39,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:39,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:39,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:39,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:39,738 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:06:39,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:39,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:39,767 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:06:39,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:39,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:39,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:39,791 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:06:39,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:39,804 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:06:39,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:06:39,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:06:39,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:39,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:39,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:06:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:40,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:40,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:06:40,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:06:40,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:06:40,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:06:40,060 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2018-04-11 15:06:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:40,547 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-04-11 15:06:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:06:40,548 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-04-11 15:06:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:40,548 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:06:40,548 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:06:40,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:06:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:06:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-04-11 15:06:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:06:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-04-11 15:06:40,550 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-04-11 15:06:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:40,550 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-04-11 15:06:40,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:06:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-04-11 15:06:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:06:40,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:40,550 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:40,550 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash -68856856, now seen corresponding path program 6 times [2018-04-11 15:06:40,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:40,551 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:40,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:40,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:40,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:40,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:40,584 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:40,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:40,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:40,585 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:06:40,634 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:06:40,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:40,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:40,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:40,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:40,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:40,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:40,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:40,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:40,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:40,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:06:40,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:40,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:40,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:40,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:06:40,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:40,681 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:06:40,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:06:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:41,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:41,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:06:41,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:06:41,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:06:41,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:06:41,026 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 19 states. [2018-04-11 15:06:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:41,654 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-04-11 15:06:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:06:41,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-04-11 15:06:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:41,655 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:06:41,655 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:06:41,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:06:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:06:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-04-11 15:06:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:06:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-04-11 15:06:41,656 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-04-11 15:06:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:41,657 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-04-11 15:06:41,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:06:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-04-11 15:06:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:06:41,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:41,657 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:41,657 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash -689789870, now seen corresponding path program 7 times [2018-04-11 15:06:41,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:41,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:41,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:41,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:41,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:41,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:41,686 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:41,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:41,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:41,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:41,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:41,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:41,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:41,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:41,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:41,743 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:06:41,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:41,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:41,758 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:06:41,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:41,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:41,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:41,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:06:41,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:41,787 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:06:41,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:06:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:42,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:42,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:06:42,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:06:42,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:06:42,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:06:42,091 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 20 states. [2018-04-11 15:06:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:42,670 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-04-11 15:06:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:06:42,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-04-11 15:06:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:42,671 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:06:42,671 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:06:42,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:06:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:06:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-04-11 15:06:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-11 15:06:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-04-11 15:06:42,672 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-04-11 15:06:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:42,672 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-04-11 15:06:42,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:06:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-04-11 15:06:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:06:42,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:42,673 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:42,673 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1969682904, now seen corresponding path program 8 times [2018-04-11 15:06:42,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:42,673 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:42,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:42,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:42,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:42,707 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:42,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:42,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:42,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:06:42,756 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:06:42,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:42,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:42,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:42,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:42,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:42,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:06:42,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:06:42,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:42,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:42,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:06:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:43,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:43,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:06:43,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:06:43,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:06:43,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:06:43,067 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 21 states. [2018-04-11 15:06:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:43,658 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-04-11 15:06:43,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:06:43,659 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-11 15:06:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:43,659 INFO L225 Difference]: With dead ends: 67 [2018-04-11 15:06:43,659 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 15:06:43,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:06:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 15:06:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-04-11 15:06:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 15:06:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-04-11 15:06:43,661 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2018-04-11 15:06:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:43,661 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-04-11 15:06:43,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:06:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-04-11 15:06:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 15:06:43,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:43,661 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:43,661 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1411098094, now seen corresponding path program 9 times [2018-04-11 15:06:43,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:43,662 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:43,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:43,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:43,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:43,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:43,696 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:43,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:43,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:43,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:06:43,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:06:43,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:43,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:43,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:43,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:43,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:43,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:43,809 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:06:43,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:43,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:43,827 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:06:43,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:43,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:43,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:43,839 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:06:43,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:43,847 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:06:43,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:06:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:44,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:44,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:06:44,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:06:44,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:06:44,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:06:44,100 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 21 states. [2018-04-11 15:06:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:44,705 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-04-11 15:06:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:06:44,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-04-11 15:06:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:44,706 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:06:44,706 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:06:44,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:06:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:06:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-04-11 15:06:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 15:06:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-04-11 15:06:44,708 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2018-04-11 15:06:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:44,708 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-04-11 15:06:44,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:06:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-04-11 15:06:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 15:06:44,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:44,708 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:44,708 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash -754784152, now seen corresponding path program 10 times [2018-04-11 15:06:44,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:44,709 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:44,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:44,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:44,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:44,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:44,733 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:44,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:44,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:06:44,776 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:06:44,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:44,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:44,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:44,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:44,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:44,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:44,804 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:06:44,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:44,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:44,822 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:06:44,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:44,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:44,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:44,830 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:06:44,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:44,834 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:06:44,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:06:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:45,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:45,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:06:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:06:45,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:06:45,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:06:45,185 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 23 states. [2018-04-11 15:06:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:46,096 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-04-11 15:06:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:06:46,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-04-11 15:06:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:46,097 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:06:46,097 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:06:46,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=1745, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:06:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:06:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-04-11 15:06:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 15:06:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-04-11 15:06:46,100 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2018-04-11 15:06:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:46,100 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-04-11 15:06:46,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:06:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-04-11 15:06:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 15:06:46,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:46,101 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:46,101 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1368252370, now seen corresponding path program 11 times [2018-04-11 15:06:46,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:46,101 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:46,102 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:46,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:46,102 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:46,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:46,219 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:46,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:46,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:46,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:06:46,292 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:06:46,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:46,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:46,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:46,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:46,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:46,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:06:46,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:06:46,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:46,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:46,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:06:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:46,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:46,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:06:46,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:06:46,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:06:46,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:06:46,683 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 23 states. [2018-04-11 15:06:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:47,400 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-04-11 15:06:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:06:47,400 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2018-04-11 15:06:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:47,400 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:06:47,400 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:06:47,401 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:06:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:06:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-04-11 15:06:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 15:06:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-04-11 15:06:47,402 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2018-04-11 15:06:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:47,402 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-04-11 15:06:47,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:06:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-04-11 15:06:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 15:06:47,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:47,403 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:47,403 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1960379736, now seen corresponding path program 12 times [2018-04-11 15:06:47,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:47,403 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:47,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:47,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:47,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:47,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:47,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:47,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:47,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:06:47,677 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:06:47,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:47,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:47,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:47,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:47,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:47,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:06:47,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:06:47,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:47,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:47,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:06:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:48,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:48,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:06:48,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:06:48,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:06:48,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:06:48,049 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 24 states. [2018-04-11 15:06:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:48,788 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-04-11 15:06:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:06:48,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-04-11 15:06:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:48,789 INFO L225 Difference]: With dead ends: 87 [2018-04-11 15:06:48,789 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:06:48,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=1834, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:06:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:06:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-04-11 15:06:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 15:06:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-04-11 15:06:48,791 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2018-04-11 15:06:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:48,791 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-04-11 15:06:48,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:06:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-04-11 15:06:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 15:06:48,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:48,792 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:48,792 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 878392722, now seen corresponding path program 13 times [2018-04-11 15:06:48,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:48,792 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:48,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:48,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:48,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:48,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:48,918 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:48,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:48,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:49,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:49,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:49,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:49,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:49,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:49,091 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:06:49,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:49,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:49,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:49,110 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:06:49,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:49,130 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:06:49,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:49,144 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:06:49,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-11 15:06:49,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:06:49,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:49,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:49,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:06:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:49,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:49,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:06:49,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:06:49,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:06:49,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:06:49,678 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 28 states. [2018-04-11 15:06:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:50,869 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-04-11 15:06:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:06:50,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-04-11 15:06:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:50,870 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:06:50,870 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:06:50,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=2679, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:06:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:06:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-04-11 15:06:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 15:06:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-04-11 15:06:50,873 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2018-04-11 15:06:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:50,873 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-04-11 15:06:50,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:06:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-04-11 15:06:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-11 15:06:50,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:50,874 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:50,874 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1274463000, now seen corresponding path program 14 times [2018-04-11 15:06:50,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:50,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:50,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:50,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:06:50,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:50,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:51,027 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:51,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:51,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:06:51,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:06:51,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:51,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:51,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:51,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:51,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:51,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:51,256 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:06:51,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:51,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:51,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:51,273 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:06:51,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:51,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:06:51,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:51,295 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:06:51,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:06:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:51,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:51,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:06:51,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:06:51,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:06:51,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:06:51,666 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 27 states. [2018-04-11 15:06:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:52,617 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-04-11 15:06:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:06:52,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 90 [2018-04-11 15:06:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:52,617 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:06:52,617 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:06:52,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=2481, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:06:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:06:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-04-11 15:06:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 15:06:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-04-11 15:06:52,619 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2018-04-11 15:06:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:52,620 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-04-11 15:06:52,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:06:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-04-11 15:06:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 15:06:52,620 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:52,620 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:52,620 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:52,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1439193938, now seen corresponding path program 15 times [2018-04-11 15:06:52,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:52,620 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:52,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:52,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:52,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:52,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:52,711 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:52,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:52,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:52,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:06:52,795 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:06:52,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:52,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:52,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:52,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:52,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:52,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:52,834 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:06:52,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:52,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:52,847 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:06:52,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:52,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:52,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:52,856 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:06:52,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:52,861 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:06:52,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:06:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:53,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:53,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:06:53,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:06:53,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:06:53,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:06:53,341 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 27 states. [2018-04-11 15:06:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:54,371 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-04-11 15:06:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:06:54,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 95 [2018-04-11 15:06:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:54,372 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:06:54,372 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:06:54,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=2386, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:06:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:06:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-04-11 15:06:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:06:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-04-11 15:06:54,374 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 95 [2018-04-11 15:06:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:54,375 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-04-11 15:06:54,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:06:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-04-11 15:06:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-11 15:06:54,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:54,375 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:54,375 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:54,376 INFO L82 PathProgramCache]: Analyzing trace with hash -642928856, now seen corresponding path program 16 times [2018-04-11 15:06:54,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:54,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:54,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:54,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:54,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:54,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:54,499 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:54,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:54,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:06:54,620 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:06:54,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:54,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:54,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:54,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:54,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:54,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:54,663 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:06:54,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:54,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:54,675 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:06:54,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:54,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:54,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:54,685 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:06:54,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:54,689 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:06:54,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:06:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:55,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:55,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:06:55,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:06:55,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:06:55,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:06:55,329 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 29 states. [2018-04-11 15:06:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:56,628 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-04-11 15:06:56,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:06:56,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2018-04-11 15:06:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:56,628 INFO L225 Difference]: With dead ends: 107 [2018-04-11 15:06:56,628 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 15:06:56,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=2897, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:06:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 15:06:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-04-11 15:06:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 15:06:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-04-11 15:06:56,631 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 100 [2018-04-11 15:06:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:56,631 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-04-11 15:06:56,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:06:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-04-11 15:06:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-04-11 15:06:56,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:56,632 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:56,632 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:56,632 INFO L82 PathProgramCache]: Analyzing trace with hash 206655762, now seen corresponding path program 17 times [2018-04-11 15:06:56,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:56,632 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:56,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:56,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:56,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:56,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:56,719 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:56,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:56,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:06:56,848 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:06:56,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:56,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:56,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:56,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:56,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:56,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:56,888 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:06:56,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:06:56,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:56,905 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:06:56,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:56,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:56,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:06:56,917 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:06:56,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:56,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:56,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-11 15:06:57,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:06:57,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:57,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:57,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-11 15:06:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:57,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:57,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:06:57,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:06:57,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:06:57,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:06:57,505 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 32 states. [2018-04-11 15:06:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:06:59,023 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-04-11 15:06:59,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:06:59,023 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2018-04-11 15:06:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:06:59,023 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:06:59,024 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:06:59,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=3458, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:06:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:06:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-04-11 15:06:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 15:06:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-04-11 15:06:59,026 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 105 [2018-04-11 15:06:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:06:59,026 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-04-11 15:06:59,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:06:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-04-11 15:06:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-11 15:06:59,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:06:59,026 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:06:59,027 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:06:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1394102632, now seen corresponding path program 18 times [2018-04-11 15:06:59,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:06:59,027 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:06:59,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:59,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:06:59,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:06:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:06:59,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:06:59,081 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:06:59,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:06:59,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:06:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:06:59,327 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-11 15:06:59,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:06:59,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:06:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:06:59,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:06:59,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:59,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:06:59,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:06:59,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:06:59,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:06:59,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:06:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:06:59,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:06:59,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 15:06:59,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:06:59,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:06:59,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:06:59,853 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 30 states. [2018-04-11 15:07:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:01,026 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-04-11 15:07:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:07:01,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 110 [2018-04-11 15:07:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:01,027 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:07:01,027 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:07:01,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=3010, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:07:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:07:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-04-11 15:07:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:07:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-04-11 15:07:01,029 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 110 [2018-04-11 15:07:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:01,029 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-04-11 15:07:01,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:07:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-04-11 15:07:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-04-11 15:07:01,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:01,030 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:01,030 INFO L408 AbstractCegarLoop]: === Iteration 35 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1015933230, now seen corresponding path program 19 times [2018-04-11 15:07:01,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:01,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:01,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:01,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:01,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:01,045 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:01,299 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:01,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:01,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:01,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:01,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:01,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:01,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:01,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:01,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:07:01,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:07:01,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:01,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:01,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:07:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:01,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:01,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:07:01,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:07:01,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:07:01,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:07:01,864 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 31 states. [2018-04-11 15:07:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:03,507 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-04-11 15:07:03,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:07:03,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 115 [2018-04-11 15:07:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:03,507 INFO L225 Difference]: With dead ends: 122 [2018-04-11 15:07:03,507 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 15:07:03,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=3234, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:07:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 15:07:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-04-11 15:07:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 15:07:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-04-11 15:07:03,510 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 115 [2018-04-11 15:07:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:03,510 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-04-11 15:07:03,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:07:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-04-11 15:07:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-04-11 15:07:03,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:03,511 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:03,511 INFO L408 AbstractCegarLoop]: === Iteration 36 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2108873816, now seen corresponding path program 20 times [2018-04-11 15:07:03,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:03,511 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:03,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:03,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:03,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:03,527 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,620 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:03,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:03,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:07:03,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:07:03,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:03,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:03,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:03,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:03,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:03,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:03,996 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:07:03,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:04,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,011 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:04,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:04,018 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,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:04,022 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:07:04,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:07:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:04,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:04,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:07:04,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:07:04,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:07:04,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:07:04,533 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 32 states. [2018-04-11 15:07:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:05,965 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-04-11 15:07:05,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:07:05,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2018-04-11 15:07:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:05,965 INFO L225 Difference]: With dead ends: 127 [2018-04-11 15:07:05,966 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 15:07:05,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=3466, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:07:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 15:07:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-04-11 15:07:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 15:07:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-04-11 15:07:05,967 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 120 [2018-04-11 15:07:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:05,968 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-04-11 15:07:05,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:07:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-04-11 15:07:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-04-11 15:07:05,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:05,968 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:05,968 INFO L408 AbstractCegarLoop]: === Iteration 37 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1146704750, now seen corresponding path program 21 times [2018-04-11 15:07:05,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:05,968 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:05,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:05,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:05,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:05,986 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:06,063 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:06,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:06,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:07:06,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 15:07:06,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:06,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:06,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:06,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:06,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:06,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:07:06,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:07:06,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:06,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:06,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:07:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:06,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:06,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:07:06,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:07:06,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:07:06,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:07:06,838 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 34 states. [2018-04-11 15:07:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:08,281 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-04-11 15:07:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:07:08,281 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 125 [2018-04-11 15:07:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:08,281 INFO L225 Difference]: With dead ends: 132 [2018-04-11 15:07:08,281 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 15:07:08,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=3950, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 15:07:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 15:07:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-04-11 15:07:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:07:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-04-11 15:07:08,283 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 125 [2018-04-11 15:07:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:08,284 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-04-11 15:07:08,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:07:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-04-11 15:07:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-11 15:07:08,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:08,284 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:08,284 INFO L408 AbstractCegarLoop]: === Iteration 38 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash 340796904, now seen corresponding path program 22 times [2018-04-11 15:07:08,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:08,284 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:08,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:08,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:08,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:08,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:08,414 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:08,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:08,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:08,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:07:08,532 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:07:08,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:08,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:08,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:08,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:08,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:08,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:08,586 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:07:08,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:08,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:08,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:08,598 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:08,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:08,602 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:08,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:08,606 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:07:08,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:07:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:09,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:09,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:07:09,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:07:09,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:07:09,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:07:09,156 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 35 states. [2018-04-11 15:07:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:10,786 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-04-11 15:07:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:07:10,786 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 130 [2018-04-11 15:07:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:10,787 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:07:10,787 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:07:10,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=4337, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:07:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:07:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-04-11 15:07:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 15:07:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-04-11 15:07:10,789 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 130 [2018-04-11 15:07:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:10,789 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-04-11 15:07:10,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:07:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-04-11 15:07:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-04-11 15:07:10,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:10,789 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:10,789 INFO L408 AbstractCegarLoop]: === Iteration 39 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -898952622, now seen corresponding path program 23 times [2018-04-11 15:07:10,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:10,790 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:10,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:10,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:10,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:10,808 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:10,876 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:10,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:10,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:10,877 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:07:11,287 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 15:07:11,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:11,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:11,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:11,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:11,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:11,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:11,333 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:07:11,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:11,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:11,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:07:11,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:11,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:11,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:11,355 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:11,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:11,360 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:07:11,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:07:11,454 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:07:11,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:11,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:11,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-11 15:07:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:11,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:11,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:07:11,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:07:11,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:07:11,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:07:11,909 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 35 states. [2018-04-11 15:07:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:13,451 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-04-11 15:07:13,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:07:13,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 135 [2018-04-11 15:07:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:13,451 INFO L225 Difference]: With dead ends: 142 [2018-04-11 15:07:13,452 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 15:07:13,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:07:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 15:07:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-04-11 15:07:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 15:07:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-04-11 15:07:13,454 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 135 [2018-04-11 15:07:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:13,454 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-04-11 15:07:13,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:07:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-04-11 15:07:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-04-11 15:07:13,455 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:13,455 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:13,455 INFO L408 AbstractCegarLoop]: === Iteration 40 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:13,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1092966440, now seen corresponding path program 24 times [2018-04-11 15:07:13,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:13,456 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:13,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:13,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:13,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:13,480 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:13,504 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:13,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:13,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:07:13,880 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-11 15:07:13,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:13,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:13,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:13,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:13,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:13,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:13,944 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:07:13,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:13,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:13,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:13,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:13,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:13,959 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:13,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:13,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:13,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:07:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:14,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:14,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 15:07:14,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:07:14,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:07:14,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:07:14,573 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 36 states. [2018-04-11 15:07:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:16,419 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-04-11 15:07:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:07:16,419 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2018-04-11 15:07:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:16,420 INFO L225 Difference]: With dead ends: 147 [2018-04-11 15:07:16,420 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 15:07:16,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=4474, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:07:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 15:07:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-04-11 15:07:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 15:07:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-04-11 15:07:16,422 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 140 [2018-04-11 15:07:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:16,422 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-04-11 15:07:16,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:07:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-04-11 15:07:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-11 15:07:16,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:16,423 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:16,423 INFO L408 AbstractCegarLoop]: === Iteration 41 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash 440092690, now seen corresponding path program 25 times [2018-04-11 15:07:16,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:16,423 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:16,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:16,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:16,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:16,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:16,558 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:16,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:16,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:16,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:16,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:16,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:16,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:16,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:16,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:16,736 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:07:16,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:16,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:16,749 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:16,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:16,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:16,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:16,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:16,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:16,761 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:07:16,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:07:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:17,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:17,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 15:07:17,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:07:17,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:07:17,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:07:17,390 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 38 states. [2018-04-11 15:07:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:19,242 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-04-11 15:07:19,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:07:19,242 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2018-04-11 15:07:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:19,242 INFO L225 Difference]: With dead ends: 152 [2018-04-11 15:07:19,242 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 15:07:19,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=5165, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:07:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 15:07:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-04-11 15:07:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 15:07:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-04-11 15:07:19,245 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 145 [2018-04-11 15:07:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:19,245 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-04-11 15:07:19,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:07:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-04-11 15:07:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-04-11 15:07:19,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:19,246 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:19,246 INFO L408 AbstractCegarLoop]: === Iteration 42 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 198228584, now seen corresponding path program 26 times [2018-04-11 15:07:19,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:19,247 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:19,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:19,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:19,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:19,286 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,435 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:19,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:19,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:19,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:07:19,897 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:07:19,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:19,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:19,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:19,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:19,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:19,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:19,973 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:07:19,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:19,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:19,985 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:19,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:19,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:19,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:19,992 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:19,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:19,996 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:07:19,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:07:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:20,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:20,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:07:20,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:07:20,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:07:20,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:07:20,710 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-04-11 15:07:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:22,679 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-04-11 15:07:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:07:22,680 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-04-11 15:07:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:22,680 INFO L225 Difference]: With dead ends: 157 [2018-04-11 15:07:22,680 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 15:07:22,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=5457, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 15:07:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 15:07:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-04-11 15:07:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 15:07:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-04-11 15:07:22,682 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 150 [2018-04-11 15:07:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:22,683 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-04-11 15:07:22,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:07:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-04-11 15:07:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-04-11 15:07:22,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:22,683 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:22,683 INFO L408 AbstractCegarLoop]: === Iteration 43 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -359445038, now seen corresponding path program 27 times [2018-04-11 15:07:22,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:22,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:22,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:22,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:22,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:22,708 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:22,950 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:22,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:22,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:22,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:07:23,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-11 15:07:23,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:23,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:23,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:23,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:23,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:23,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:23,253 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:07:23,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:23,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:23,269 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:23,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:23,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:23,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:23,279 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:23,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:23,282 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:07:23,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:07:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:23,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:23,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:07:23,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:07:23,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:07:23,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:07:23,978 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 39 states. [2018-04-11 15:07:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:26,031 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-04-11 15:07:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:07:26,032 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-04-11 15:07:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:26,032 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:07:26,032 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:07:26,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=236, Invalid=5314, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:07:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:07:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-04-11 15:07:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 15:07:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-04-11 15:07:26,035 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 155 [2018-04-11 15:07:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:26,035 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-04-11 15:07:26,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:07:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-04-11 15:07:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-04-11 15:07:26,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:26,036 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:26,036 INFO L408 AbstractCegarLoop]: === Iteration 44 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2108273496, now seen corresponding path program 28 times [2018-04-11 15:07:26,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:26,036 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:26,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:26,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:26,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:26,063 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:26,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:26,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:26,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:07:26,552 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:07:26,553 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:26,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:26,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:26,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:26,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:26,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:26,642 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:07:26,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:26,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:26,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:26,652 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:26,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:26,660 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:26,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:26,665 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:07:26,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:07:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:26,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:26,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:26,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-11 15:07:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:27,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:27,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-11 15:07:27,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 15:07:27,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 15:07:27,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:07:27,544 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 42 states. [2018-04-11 15:07:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:30,190 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-04-11 15:07:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 15:07:30,190 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-04-11 15:07:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:30,191 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:07:30,191 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:07:30,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=260, Invalid=6220, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 15:07:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:07:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-04-11 15:07:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 15:07:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-04-11 15:07:30,194 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 160 [2018-04-11 15:07:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:30,194 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-04-11 15:07:30,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 15:07:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-04-11 15:07:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-04-11 15:07:30,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:30,195 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:30,195 INFO L408 AbstractCegarLoop]: === Iteration 45 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1341072274, now seen corresponding path program 29 times [2018-04-11 15:07:30,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:30,196 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:30,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:30,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:30,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:30,236 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:30,509 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:30,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:30,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:30,509 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:07:30,994 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 15:07:30,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:31,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:31,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:31,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:31,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:31,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:07:31,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:07:31,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:31,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:31,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:07:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:31,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:31,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:07:31,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:07:31,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:07:31,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:07:31,681 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 40 states. [2018-04-11 15:07:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:33,664 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2018-04-11 15:07:33,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:07:33,664 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 165 [2018-04-11 15:07:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:33,665 INFO L225 Difference]: With dead ends: 172 [2018-04-11 15:07:33,665 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 15:07:33,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=5465, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 15:07:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 15:07:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-04-11 15:07:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-11 15:07:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-04-11 15:07:33,668 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 165 [2018-04-11 15:07:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:33,668 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-04-11 15:07:33,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:07:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-04-11 15:07:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-11 15:07:33,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:33,669 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:33,669 INFO L408 AbstractCegarLoop]: === Iteration 46 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:33,670 INFO L82 PathProgramCache]: Analyzing trace with hash -38138136, now seen corresponding path program 30 times [2018-04-11 15:07:33,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:33,670 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:33,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:33,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:33,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:33,698 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:34,042 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:34,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:34,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:34,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:07:34,629 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-11 15:07:34,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:34,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:34,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:34,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:34,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:34,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:34,698 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:07:34,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:34,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:07:34,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:34,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:34,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:34,718 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:34,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:34,722 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:07:34,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:07:35,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:07:35,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:35,641 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:35,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-04-11 15:07:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:35,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:35,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-11 15:07:35,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:07:35,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:07:35,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:07:35,766 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-04-11 15:07:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:38,776 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-04-11 15:07:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:07:38,777 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-04-11 15:07:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:38,777 INFO L225 Difference]: With dead ends: 177 [2018-04-11 15:07:38,777 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 15:07:38,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=282, Invalid=7028, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 15:07:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 15:07:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-04-11 15:07:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 15:07:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-04-11 15:07:38,779 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 170 [2018-04-11 15:07:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:38,779 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-04-11 15:07:38,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:07:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-04-11 15:07:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-04-11 15:07:38,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:38,780 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:38,780 INFO L408 AbstractCegarLoop]: === Iteration 47 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash -204813998, now seen corresponding path program 31 times [2018-04-11 15:07:38,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:38,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:38,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:38,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:38,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:38,811 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:38,934 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:38,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:38,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:39,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:39,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:07:39,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:39,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:39,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:39,156 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:07:39,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:39,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:39,175 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:39,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:39,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:39,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:39,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:07:39,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:39,189 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:07:39,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:07:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:40,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:40,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-11 15:07:40,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:07:40,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:07:40,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:07:40,005 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 44 states. [2018-04-11 15:07:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:42,580 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-04-11 15:07:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:07:42,580 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-04-11 15:07:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:42,581 INFO L225 Difference]: With dead ends: 182 [2018-04-11 15:07:42,581 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 15:07:42,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=7037, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 15:07:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 15:07:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-04-11 15:07:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 15:07:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-04-11 15:07:42,583 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 175 [2018-04-11 15:07:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:42,583 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-04-11 15:07:42,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:07:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-04-11 15:07:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-11 15:07:42,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:42,583 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:42,583 INFO L408 AbstractCegarLoop]: === Iteration 48 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1644167464, now seen corresponding path program 32 times [2018-04-11 15:07:42,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:42,584 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:42,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:07:42,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:42,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:07:43,011 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:43,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:43,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:43,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:07:43,598 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:07:43,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:43,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:43,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:43,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:43,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:43,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:07:43,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:07:43,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:43,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:43,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:07:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:44,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:44,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:07:44,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:07:44,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:07:44,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:07:44,567 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 45 states. [2018-04-11 15:07:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:47,027 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-04-11 15:07:47,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:07:47,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 180 [2018-04-11 15:07:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:47,028 INFO L225 Difference]: With dead ends: 187 [2018-04-11 15:07:47,028 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 15:07:47,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=275, Invalid=7207, Unknown=0, NotChecked=0, Total=7482 [2018-04-11 15:07:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 15:07:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-04-11 15:07:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 15:07:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-04-11 15:07:47,030 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 180 [2018-04-11 15:07:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:47,031 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-04-11 15:07:47,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:07:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-04-11 15:07:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-04-11 15:07:47,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:47,031 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:47,031 INFO L408 AbstractCegarLoop]: === Iteration 49 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash -727564526, now seen corresponding path program 33 times [2018-04-11 15:07:47,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:47,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:47,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:47,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:47,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:47,063 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:47,604 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:47,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:47,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:47,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:07:47,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-11 15:07:47,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:47,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:47,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:47,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:47,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:47,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:07:48,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:07:48,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:48,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:48,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:07:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:48,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:48,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:07:48,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:07:48,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:07:48,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:07:48,861 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 45 states. [2018-04-11 15:07:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:51,520 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-04-11 15:07:51,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:07:51,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 185 [2018-04-11 15:07:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:51,521 INFO L225 Difference]: With dead ends: 192 [2018-04-11 15:07:51,521 INFO L226 Difference]: Without dead ends: 192 [2018-04-11 15:07:51,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=272, Invalid=7210, Unknown=0, NotChecked=0, Total=7482 [2018-04-11 15:07:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-11 15:07:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-04-11 15:07:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 15:07:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-04-11 15:07:51,523 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 185 [2018-04-11 15:07:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:51,524 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-04-11 15:07:51,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:07:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-04-11 15:07:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-04-11 15:07:51,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:51,525 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:51,525 INFO L408 AbstractCegarLoop]: === Iteration 50 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1579950952, now seen corresponding path program 34 times [2018-04-11 15:07:51,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:51,526 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:51,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:51,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:51,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:51,565 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:51,615 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:51,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:51,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:07:51,994 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:07:51,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:52,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:52,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,103 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:07:52,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:07:52,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:52,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:07:52,120 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,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,128 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,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:52,133 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:07:52,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:07:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:53,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:53,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-11 15:07:53,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 15:07:53,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 15:07:53,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:07:53,157 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 47 states. [2018-04-11 15:07:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:07:56,006 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-04-11 15:07:56,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 15:07:56,006 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 190 [2018-04-11 15:07:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:07:56,007 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:07:56,007 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:07:56,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=291, Invalid=8081, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 15:07:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:07:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-04-11 15:07:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 15:07:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-04-11 15:07:56,009 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 190 [2018-04-11 15:07:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:07:56,009 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-04-11 15:07:56,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 15:07:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-04-11 15:07:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-04-11 15:07:56,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:07:56,010 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:07:56,010 INFO L408 AbstractCegarLoop]: === Iteration 51 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:07:56,010 INFO L82 PathProgramCache]: Analyzing trace with hash 99714258, now seen corresponding path program 35 times [2018-04-11 15:07:56,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:07:56,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:07:56,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:56,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:07:56,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:07:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:07:56,048 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:56,494 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:07:56,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:07:56,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:07:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:07:57,104 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-11 15:07:57,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:07:57,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:07:57,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:57,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:57,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:57,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:07:57,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:07:57,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:07:57,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:57,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:07:57,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:07:57,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:07:57,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:07:57,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-04-11 15:07:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:07:58,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:07:58,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-11 15:07:58,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 15:07:58,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 15:07:58,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:07:58,163 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 48 states. [2018-04-11 15:08:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:01,076 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-04-11 15:08:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 15:08:01,077 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 195 [2018-04-11 15:08:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:01,077 INFO L225 Difference]: With dead ends: 202 [2018-04-11 15:08:01,077 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 15:08:01,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=293, Invalid=8263, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:08:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 15:08:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-04-11 15:08:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 15:08:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-04-11 15:08:01,080 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 195 [2018-04-11 15:08:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:01,080 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-04-11 15:08:01,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 15:08:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-04-11 15:08:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-04-11 15:08:01,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:01,080 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:01,080 INFO L408 AbstractCegarLoop]: === Iteration 52 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1404930648, now seen corresponding path program 36 times [2018-04-11 15:08:01,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:01,081 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:01,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:01,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:01,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:01,118 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:01,679 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:01,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:01,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:01,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:08:02,500 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-11 15:08:02,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:02,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:02,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:02,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:02,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:02,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:02,579 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:08:02,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:08:02,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:02,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:02,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:02,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:02,595 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:02,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:02,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:02,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:08:03,601 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:08:03,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:03,605 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:08:03,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2018-04-11 15:08:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:03,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:03,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-11 15:08:03,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 15:08:03,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 15:08:03,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:08:03,773 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 49 states. [2018-04-11 15:08:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:07,281 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-04-11 15:08:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:08:07,281 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 200 [2018-04-11 15:08:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:07,282 INFO L225 Difference]: With dead ends: 207 [2018-04-11 15:08:07,282 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 15:08:07,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=305, Invalid=8625, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 15:08:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 15:08:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-04-11 15:08:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-11 15:08:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-04-11 15:08:07,285 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 200 [2018-04-11 15:08:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:07,285 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-04-11 15:08:07,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 15:08:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-04-11 15:08:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-04-11 15:08:07,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:07,286 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:07,286 INFO L408 AbstractCegarLoop]: === Iteration 53 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1882495634, now seen corresponding path program 37 times [2018-04-11 15:08:07,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:07,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:07,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:07,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:07,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:07,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:07,394 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:07,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:07,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:07,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:07,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:07,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:07,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:07,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:07,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:07,935 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:08:07,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:08:07,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:07,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:07,946 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:07,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:07,950 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:07,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:07,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:07,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:08:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:09,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:09,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-11 15:08:09,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:08:09,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:08:09,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:08:09,172 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 50 states. [2018-04-11 15:08:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:12,484 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-04-11 15:08:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 15:08:12,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 205 [2018-04-11 15:08:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:12,485 INFO L225 Difference]: With dead ends: 212 [2018-04-11 15:08:12,485 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 15:08:12,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=309, Invalid=9197, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 15:08:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 15:08:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-04-11 15:08:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-11 15:08:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-04-11 15:08:12,487 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 205 [2018-04-11 15:08:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:12,487 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-04-11 15:08:12,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:08:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-04-11 15:08:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-11 15:08:12,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:12,488 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:12,488 INFO L408 AbstractCegarLoop]: === Iteration 54 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1363605480, now seen corresponding path program 38 times [2018-04-11 15:08:12,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:12,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:12,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:12,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:12,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:12,526 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:13,046 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:13,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:13,046 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:13,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:08:13,987 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:08:13,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:14,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:14,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:08:14,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:08:14,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:08:14,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:14,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:08:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:15,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:15,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-11 15:08:15,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 15:08:15,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 15:08:15,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:08:15,233 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 51 states. [2018-04-11 15:08:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:18,511 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-04-11 15:08:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:08:18,511 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 210 [2018-04-11 15:08:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:18,512 INFO L225 Difference]: With dead ends: 217 [2018-04-11 15:08:18,512 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 15:08:18,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=315, Invalid=9585, Unknown=0, NotChecked=0, Total=9900 [2018-04-11 15:08:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 15:08:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-04-11 15:08:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 15:08:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-04-11 15:08:18,514 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 210 [2018-04-11 15:08:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:18,514 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-04-11 15:08:18,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 15:08:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-04-11 15:08:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-04-11 15:08:18,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:18,515 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:18,515 INFO L408 AbstractCegarLoop]: === Iteration 55 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1863876526, now seen corresponding path program 39 times [2018-04-11 15:08:18,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:18,515 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:18,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:18,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:18,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:18,559 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:19,028 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:19,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:19,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:08:20,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-11 15:08:20,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:20,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:20,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:08:20,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:08:20,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:08:20,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:20,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:08:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:21,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:21,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-11 15:08:21,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 15:08:21,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 15:08:21,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:08:21,423 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 51 states. [2018-04-11 15:08:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:24,583 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-04-11 15:08:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 15:08:24,583 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 215 [2018-04-11 15:08:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:24,584 INFO L225 Difference]: With dead ends: 222 [2018-04-11 15:08:24,584 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 15:08:24,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=308, Invalid=9394, Unknown=0, NotChecked=0, Total=9702 [2018-04-11 15:08:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 15:08:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-04-11 15:08:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 15:08:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-04-11 15:08:24,587 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 215 [2018-04-11 15:08:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:24,587 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-04-11 15:08:24,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 15:08:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-04-11 15:08:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-11 15:08:24,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:24,587 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:24,587 INFO L408 AbstractCegarLoop]: === Iteration 56 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash -583161304, now seen corresponding path program 40 times [2018-04-11 15:08:24,588 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:24,588 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:24,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:24,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:24,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:24,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:24,758 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:24,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:24,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:08:25,323 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:08:25,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:25,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:25,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:25,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:25,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:25,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:25,467 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:08:25,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:08:25,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:25,482 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:25,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:25,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:25,489 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:25,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:25,493 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:08:25,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:08:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:26,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:26,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-11 15:08:26,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 15:08:26,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 15:08:26,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:08:26,725 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 52 states. [2018-04-11 15:08:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:30,448 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-04-11 15:08:30,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:08:30,481 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 220 [2018-04-11 15:08:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:30,482 INFO L225 Difference]: With dead ends: 227 [2018-04-11 15:08:30,482 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 15:08:30,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=314, Invalid=9786, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 15:08:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 15:08:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-04-11 15:08:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-11 15:08:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-04-11 15:08:30,484 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 220 [2018-04-11 15:08:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:30,484 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-04-11 15:08:30,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 15:08:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-04-11 15:08:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-04-11 15:08:30,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:30,485 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:30,485 INFO L408 AbstractCegarLoop]: === Iteration 57 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 981874194, now seen corresponding path program 41 times [2018-04-11 15:08:30,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:30,485 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:30,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:30,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:30,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:30,531 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:31,119 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:31,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:31,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:31,119 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:08:32,059 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-11 15:08:32,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:32,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:32,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:32,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:32,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 6 treesize of output 5 [2018-04-11 15:08:32,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:32,125 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:08:32,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:08:32,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:32,136 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:32,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:32,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:32,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:32,144 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:08:32,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:32,150 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:08:32,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:08:32,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:08:32,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:32,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:32,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:08:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:33,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:33,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-11 15:08:33,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:08:33,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:08:33,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:08:33,439 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 53 states. [2018-04-11 15:08:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:37,777 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2018-04-11 15:08:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:08:37,778 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 225 [2018-04-11 15:08:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:37,778 INFO L225 Difference]: With dead ends: 232 [2018-04-11 15:08:37,778 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 15:08:37,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=316, Invalid=9986, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 15:08:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 15:08:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-04-11 15:08:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-11 15:08:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-04-11 15:08:37,781 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 225 [2018-04-11 15:08:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:37,781 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-04-11 15:08:37,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:08:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-04-11 15:08:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-04-11 15:08:37,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:37,782 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:37,782 INFO L408 AbstractCegarLoop]: === Iteration 58 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1423274904, now seen corresponding path program 42 times [2018-04-11 15:08:37,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:37,782 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:37,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:37,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:37,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:37,860 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:38,294 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:38,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:38,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:38,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:08:39,908 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 15:08:39,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:39,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:39,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:39,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:39,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:39,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:39,980 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:08:39,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:08:39,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:39,991 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:39,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:40,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:40,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:08:40,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:40,010 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:08:40,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:08:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:08:41,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:41,375 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:08:41,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-04-11 15:08:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:41,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:41,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-11 15:08:41,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:08:41,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:08:41,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:08:41,555 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 56 states. [2018-04-11 15:08:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:46,066 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-04-11 15:08:46,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 15:08:46,066 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 230 [2018-04-11 15:08:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:46,067 INFO L225 Difference]: With dead ends: 237 [2018-04-11 15:08:46,067 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 15:08:46,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=350, Invalid=11422, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 15:08:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 15:08:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-04-11 15:08:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 15:08:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-04-11 15:08:46,069 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 230 [2018-04-11 15:08:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:46,069 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-04-11 15:08:46,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:08:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-04-11 15:08:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-04-11 15:08:46,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:46,070 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:46,070 INFO L408 AbstractCegarLoop]: === Iteration 59 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1418509266, now seen corresponding path program 43 times [2018-04-11 15:08:46,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:46,071 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:46,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:46,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:08:46,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:46,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:08:46,820 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:46,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:46,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:46,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:47,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:47,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:47,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:47,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:08:47,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:47,729 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:08:47,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:08:47,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:47,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:47,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:47,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:47,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:08:47,754 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:47,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:47,758 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:08:47,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:08:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:49,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:49,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-11 15:08:49,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 15:08:49,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 15:08:49,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:08:49,091 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 56 states. [2018-04-11 15:08:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:08:53,327 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2018-04-11 15:08:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:08:53,327 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 235 [2018-04-11 15:08:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:08:53,328 INFO L225 Difference]: With dead ends: 242 [2018-04-11 15:08:53,328 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 15:08:53,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=345, Invalid=11645, Unknown=0, NotChecked=0, Total=11990 [2018-04-11 15:08:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 15:08:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-04-11 15:08:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-11 15:08:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-04-11 15:08:53,331 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 235 [2018-04-11 15:08:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:08:53,331 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-04-11 15:08:53,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 15:08:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-04-11 15:08:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-04-11 15:08:53,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:08:53,332 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:08:53,332 INFO L408 AbstractCegarLoop]: === Iteration 60 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:08:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 554802856, now seen corresponding path program 44 times [2018-04-11 15:08:53,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:08:53,333 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:08:53,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:53,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:08:53,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:08:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:08:53,398 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:53,802 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:08:53,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:08:53,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:08:53,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:08:55,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:08:55,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:08:55,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:08:55,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:55,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:08:55,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:55,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:08:55,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:08:55,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:08:55,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:08:55,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:08:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:08:56,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:08:56,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-11 15:08:56,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:08:56,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:08:56,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:08:56,649 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 57 states. [2018-04-11 15:09:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:00,620 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-04-11 15:09:00,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 15:09:00,620 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 240 [2018-04-11 15:09:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:00,621 INFO L225 Difference]: With dead ends: 247 [2018-04-11 15:09:00,621 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 15:09:00,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=351, Invalid=12081, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 15:09:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 15:09:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-04-11 15:09:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-11 15:09:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-04-11 15:09:00,624 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 240 [2018-04-11 15:09:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:00,625 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-04-11 15:09:00,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:09:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-04-11 15:09:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-04-11 15:09:00,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:00,626 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:00,626 INFO L408 AbstractCegarLoop]: === Iteration 61 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1686695534, now seen corresponding path program 45 times [2018-04-11 15:09:00,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:00,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:00,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:00,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:00,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:00,696 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:01,123 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:01,123 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:01,123 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:01,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-11 15:09:01,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:01,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:01,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:01,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:01,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:01,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:01,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:01,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:09:02,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:02,032 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:02,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:02,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:02,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:02,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:09:02,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:02,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:02,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:09:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:03,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:03,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-11 15:09:03,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:09:03,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:09:03,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:09:03,550 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 57 states. [2018-04-11 15:09:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:07,985 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2018-04-11 15:09:07,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:09:07,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 245 [2018-04-11 15:09:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:07,985 INFO L225 Difference]: With dead ends: 252 [2018-04-11 15:09:07,986 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 15:09:07,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=344, Invalid=11866, Unknown=0, NotChecked=0, Total=12210 [2018-04-11 15:09:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 15:09:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-04-11 15:09:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-11 15:09:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-04-11 15:09:07,988 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 245 [2018-04-11 15:09:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:07,989 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-04-11 15:09:07,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:09:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-04-11 15:09:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-04-11 15:09:07,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:07,990 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:07,990 INFO L408 AbstractCegarLoop]: === Iteration 62 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash -269033240, now seen corresponding path program 46 times [2018-04-11 15:09:07,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:07,990 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:07,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:07,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:07,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:08,063 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:08,376 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:08,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:08,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:09:09,215 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:09:09,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:09,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:09,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:09,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:09,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 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:09,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:09,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:09:09,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:09,360 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:09,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:09,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:09,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:09,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:09:09,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:09,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:09,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:09:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:10,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:10,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-11 15:09:10,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 15:09:10,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 15:09:10,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:09:10,864 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 59 states. [2018-04-11 15:09:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:15,452 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-04-11 15:09:15,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 15:09:15,453 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 250 [2018-04-11 15:09:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:15,453 INFO L225 Difference]: With dead ends: 257 [2018-04-11 15:09:15,454 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 15:09:15,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=363, Invalid=12977, Unknown=0, NotChecked=0, Total=13340 [2018-04-11 15:09:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 15:09:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2018-04-11 15:09:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-11 15:09:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-04-11 15:09:15,456 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 250 [2018-04-11 15:09:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:15,456 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-04-11 15:09:15,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 15:09:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-04-11 15:09:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-04-11 15:09:15,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:15,457 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:15,457 INFO L408 AbstractCegarLoop]: === Iteration 63 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1623275346, now seen corresponding path program 47 times [2018-04-11 15:09:15,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:15,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:15,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:15,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:15,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:15,531 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:16,396 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:16,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:16,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:16,397 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:09:18,487 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 15:09:18,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:18,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:18,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:18,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:18,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:18,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:09:18,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:09:18,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:18,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:18,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:09:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:19,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:19,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-11 15:09:19,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 15:09:19,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 15:09:19,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:09:19,872 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 58 states. [2018-04-11 15:09:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:24,014 INFO L93 Difference]: Finished difference Result 262 states and 263 transitions. [2018-04-11 15:09:24,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:09:24,015 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 255 [2018-04-11 15:09:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:24,015 INFO L225 Difference]: With dead ends: 262 [2018-04-11 15:09:24,015 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 15:09:24,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=343, Invalid=12089, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 15:09:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 15:09:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-04-11 15:09:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 15:09:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-04-11 15:09:24,017 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 255 [2018-04-11 15:09:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:24,018 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-04-11 15:09:24,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 15:09:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-04-11 15:09:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-04-11 15:09:24,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:24,018 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:24,018 INFO L408 AbstractCegarLoop]: === Iteration 64 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1407079208, now seen corresponding path program 48 times [2018-04-11 15:09:24,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:24,019 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:24,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:24,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:24,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:24,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-11 15:09:24,373 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-11 15:09:24,375 INFO L168 Benchmark]: Toolchain (without parser) took 174323.11 ms. Allocated memory was 404.8 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 338.1 MB in the beginning and 941.8 MB in the end (delta: -603.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-11 15:09:24,376 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 404.8 MB. Free memory is still 364.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:09:24,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.30 ms. Allocated memory is still 404.8 MB. Free memory was 336.3 MB in the beginning and 312.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:24,376 INFO L168 Benchmark]: Boogie Preprocessor took 33.20 ms. Allocated memory is still 404.8 MB. Free memory was 312.5 MB in the beginning and 311.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:24,377 INFO L168 Benchmark]: RCFGBuilder took 371.89 ms. Allocated memory was 404.8 MB in the beginning and 596.6 MB in the end (delta: 191.9 MB). Free memory was 311.2 MB in the beginning and 535.1 MB in the end (delta: -224.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:09:24,377 INFO L168 Benchmark]: TraceAbstraction took 173691.35 ms. Allocated memory was 596.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 535.1 MB in the beginning and 941.8 MB in the end (delta: -406.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-04-11 15:09:24,378 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.18 ms. Allocated memory is still 404.8 MB. Free memory is still 364.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.30 ms. Allocated memory is still 404.8 MB. Free memory was 336.3 MB in the beginning and 312.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.20 ms. Allocated memory is still 404.8 MB. Free memory was 312.5 MB in the beginning and 311.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.89 ms. Allocated memory was 404.8 MB in the beginning and 596.6 MB in the end (delta: 191.9 MB). Free memory was 311.2 MB in the beginning and 535.1 MB in the end (delta: -224.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 173691.35 ms. Allocated memory was 596.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 535.1 MB in the beginning and 941.8 MB in the end (delta: -406.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-09-24-382.csv Completed graceful shutdown