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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:06:05,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:06:05,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:06:05,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:06:05,587 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:06:05,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:06:05,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:06:05,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:06:05,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:06:05,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:06:05,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:06:05,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:06:05,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:06:05,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:06:05,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:06:05,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:06:05,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:06:05,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:06:05,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:06:05,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:06:05,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:06:05,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:06:05,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:06:05,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:06:05,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:06:05,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:06:05,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:06:05,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:06:05,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:06:05,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:06:05,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:06:05,608 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 04:06:05,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:06:05,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:06:05,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:06:05,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:06:05,620 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:06:05,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:06:05,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:06:05,620 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:06:05,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:06:05,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:06:05,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:06:05,621 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:06:05,621 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:06:05,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:06:05,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:06:05,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:06:05,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:06:05,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:06:05,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:06:05,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:06:05,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:06:05,622 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:06:05,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:06:05,623 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 04:06:05,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:06:05,663 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:06:05,667 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:06:05,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:06:05,668 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:06:05,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:05,956 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG34a9eff9c [2018-04-13 04:06:06,117 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:06:06,117 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:06:06,119 INFO L168 CDTParser]: Scanning cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,128 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:06:06,128 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:06:06,128 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:06:06,129 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:06:06,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,129 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__off_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__register_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,130 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__uint in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_short in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,131 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__id_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____u_short in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,132 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____u_int in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__time_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,133 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____key_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__ushort in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,134 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____time_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__ulong in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____u_long in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_char in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,135 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____off_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_long in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_int in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,136 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__div_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__size_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__key_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,137 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____id_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____u_char in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,138 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,164 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG34a9eff9c [2018-04-13 04:06:06,167 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:06:06,168 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:06:06,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:06:06,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:06:06,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:06:06,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c382e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06, skipping insertion in model container [2018-04-13 04:06:06,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,191 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:06:06,213 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:06:06,358 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:06:06,395 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:06:06,401 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:06:06,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06 WrapperNode [2018-04-13 04:06:06,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:06:06,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:06:06,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:06:06,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:06:06,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... [2018-04-13 04:06:06,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:06:06,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:06:06,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:06:06,475 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:06:06,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:06:06,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:06:06,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:06:06,566 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:06:06,566 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:06:06,566 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-04-13 04:06:06,566 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:06:06,566 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:06:06,566 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:06:06,566 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:06:06,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:06:06,568 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:06:06,569 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:06:06,570 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:06:06,571 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:06:06,572 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:06:06,573 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:06:06,574 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:06:06,575 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:06:06,576 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:06:06,577 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:06:06,578 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:06:06,828 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:06:06,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:06:06 BoogieIcfgContainer [2018-04-13 04:06:06,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:06:06,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:06:06,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:06:06,831 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:06:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:06:06" (1/3) ... [2018-04-13 04:06:06,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b81bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:06:06, skipping insertion in model container [2018-04-13 04:06:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:06:06" (2/3) ... [2018-04-13 04:06:06,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b81bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:06:06, skipping insertion in model container [2018-04-13 04:06:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:06:06" (3/3) ... [2018-04-13 04:06:06,832 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:06:06,837 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:06:06,842 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-13 04:06:06,870 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:06:06,871 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:06:06,871 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:06:06,871 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:06:06,871 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:06:06,871 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:06:06,871 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:06:06,871 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:06:06,871 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:06:06,872 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:06:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-04-13 04:06:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:06:06,884 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:06,884 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:06,884 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1596208369, now seen corresponding path program 1 times [2018-04-13 04:06:06,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:06,888 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:06,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:06,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:06,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:06,952 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:06,965 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:06,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:06,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:06,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:07,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:07,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:06:07,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:06:07,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:07,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 04:06:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:06:07,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:06:07,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:06:07,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:06:07,094 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 5 states. [2018-04-13 04:06:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,212 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-13 04:06:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:06:07,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 04:06:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,220 INFO L225 Difference]: With dead ends: 57 [2018-04-13 04:06:07,221 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:06:07,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:06:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:06:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 04:06:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:06:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-13 04:06:07,244 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-04-13 04:06:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,245 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-13 04:06:07,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:06:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-13 04:06:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:06:07,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,245 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,245 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1596208368, now seen corresponding path program 1 times [2018-04-13 04:06:07,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,257 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,263 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:07,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:07,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:07,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:07,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:07,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:07,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:06:07,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:06:07,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:07,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:06:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:06:07,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:06:07,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:06:07,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:06:07,367 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-04-13 04:06:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,435 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-04-13 04:06:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:06:07,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:06:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,438 INFO L225 Difference]: With dead ends: 71 [2018-04-13 04:06:07,438 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 04:06:07,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:06:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 04:06:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2018-04-13 04:06:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 04:06:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-04-13 04:06:07,447 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2018-04-13 04:06:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,447 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-04-13 04:06:07,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:06:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-04-13 04:06:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:06:07,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,448 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,448 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash 178798994, now seen corresponding path program 1 times [2018-04-13 04:06:07,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,448 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,460 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,463 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:07,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:07,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:07,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:07,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:07,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:07,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:06:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:07,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:07,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:06:07,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:07,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:06:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:06:07,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:06:07,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:06:07,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:06:07,579 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-04-13 04:06:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,666 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-04-13 04:06:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:06:07,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:06:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,667 INFO L225 Difference]: With dead ends: 59 [2018-04-13 04:06:07,667 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 04:06:07,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:06:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 04:06:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-04-13 04:06:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 04:06:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-13 04:06:07,671 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-04-13 04:06:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,672 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-13 04:06:07,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:06:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-13 04:06:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:06:07,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,672 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,672 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2057148167, now seen corresponding path program 1 times [2018-04-13 04:06:07,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,673 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,682 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:06:07,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:06:07,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:06:07,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:06:07,702 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-04-13 04:06:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,758 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-04-13 04:06:07,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:06:07,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:06:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,759 INFO L225 Difference]: With dead ends: 52 [2018-04-13 04:06:07,759 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 04:06:07,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:06:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 04:06:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 04:06:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:06:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-13 04:06:07,762 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-04-13 04:06:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,762 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-13 04:06:07,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:06:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-13 04:06:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:06:07,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,762 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,762 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2057148168, now seen corresponding path program 1 times [2018-04-13 04:06:07,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,769 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:06:07,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:06:07,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:06:07,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:06:07,811 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-04-13 04:06:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,832 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-13 04:06:07,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:06:07,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:06:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,833 INFO L225 Difference]: With dead ends: 51 [2018-04-13 04:06:07,833 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 04:06:07,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:06:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 04:06:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 04:06:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:06:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-13 04:06:07,836 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-04-13 04:06:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,836 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-13 04:06:07,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:06:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-13 04:06:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:06:07,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,837 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,837 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash 880492650, now seen corresponding path program 1 times [2018-04-13 04:06:07,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,837 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,847 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:06:07,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:06:07,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:06:07,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:06:07,870 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-04-13 04:06:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:07,907 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-13 04:06:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:06:07,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 04:06:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:07,908 INFO L225 Difference]: With dead ends: 49 [2018-04-13 04:06:07,908 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 04:06:07,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:06:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 04:06:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 04:06:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 04:06:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-13 04:06:07,910 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-04-13 04:06:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:07,910 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-13 04:06:07,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:06:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-13 04:06:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:06:07,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:07,911 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:07,911 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash 880492651, now seen corresponding path program 1 times [2018-04-13 04:06:07,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:07,912 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:07,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:07,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:07,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:07,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:07,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:06:07,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:06:07,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:06:07,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:06:07,989 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-04-13 04:06:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:08,065 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-04-13 04:06:08,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:06:08,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-13 04:06:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:08,067 INFO L225 Difference]: With dead ends: 73 [2018-04-13 04:06:08,067 INFO L226 Difference]: Without dead ends: 73 [2018-04-13 04:06:08,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:06:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-13 04:06:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-04-13 04:06:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 04:06:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-04-13 04:06:08,069 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-04-13 04:06:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:08,069 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-04-13 04:06:08,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:06:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-04-13 04:06:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:06:08,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:08,070 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:08,070 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1252202925, now seen corresponding path program 1 times [2018-04-13 04:06:08,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:08,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:08,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,080 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:08,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:08,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:06:08,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:06:08,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:06:08,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:06:08,108 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-04-13 04:06:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:08,158 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-04-13 04:06:08,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:06:08,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-13 04:06:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:08,159 INFO L225 Difference]: With dead ends: 53 [2018-04-13 04:06:08,159 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 04:06:08,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:06:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 04:06:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-13 04:06:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:06:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-04-13 04:06:08,162 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-04-13 04:06:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:08,163 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-04-13 04:06:08,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:06:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-04-13 04:06:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:06:08,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:08,163 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:08,163 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1252202926, now seen corresponding path program 1 times [2018-04-13 04:06:08,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:08,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:08,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,173 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:08,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:08,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:06:08,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 04:06:08,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 04:06:08,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:06:08,246 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-04-13 04:06:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:08,331 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-04-13 04:06:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:06:08,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-04-13 04:06:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:08,332 INFO L225 Difference]: With dead ends: 67 [2018-04-13 04:06:08,332 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 04:06:08,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:06:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 04:06:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-04-13 04:06:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-13 04:06:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-04-13 04:06:08,334 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-04-13 04:06:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:08,334 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-04-13 04:06:08,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 04:06:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-04-13 04:06:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:06:08,335 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:08,335 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:08,335 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:08,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1282364997, now seen corresponding path program 1 times [2018-04-13 04:06:08,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:08,335 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:08,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,342 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:08,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:08,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:06:08,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 04:06:08,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 04:06:08,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:06:08,355 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-04-13 04:06:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:08,359 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-04-13 04:06:08,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 04:06:08,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-13 04:06:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:08,359 INFO L225 Difference]: With dead ends: 60 [2018-04-13 04:06:08,359 INFO L226 Difference]: Without dead ends: 60 [2018-04-13 04:06:08,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:06:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-13 04:06:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-13 04:06:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 04:06:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-04-13 04:06:08,365 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-04-13 04:06:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:08,366 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-04-13 04:06:08,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 04:06:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-04-13 04:06:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:06:08,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:08,366 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] [2018-04-13 04:06:08,366 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1110592865, now seen corresponding path program 1 times [2018-04-13 04:06:08,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:08,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:08,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,376 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:08,378 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:08,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:08,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:08,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:08,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:08,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 04:06:08,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:08,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:06:08,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:08,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:06:08,449 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-13 04:06:08,453 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-13 04:06:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:08,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:08,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:06:08,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:06:08,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:06:08,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:06:08,458 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 8 states. [2018-04-13 04:06:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:08,530 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-04-13 04:06:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:06:08,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 04:06:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:08,530 INFO L225 Difference]: With dead ends: 59 [2018-04-13 04:06:08,530 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 04:06:08,531 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:06:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 04:06:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 04:06:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:06:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-04-13 04:06:08,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-04-13 04:06:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:08,533 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-04-13 04:06:08,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:06:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-04-13 04:06:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:06:08,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:08,533 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:08,534 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 121291838, now seen corresponding path program 1 times [2018-04-13 04:06:08,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:08,534 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:08,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,548 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:08,552 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:08,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:08,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:08,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:08,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 04:06:08,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 11 treesize of output 10 [2018-04-13 04:06:08,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:08,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-13 04:06:08,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-04-13 04:06:08,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-13 04:06:08,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:08,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-04-13 04:06:08,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-13 04:06:08,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:06:08,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 04:06:08,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:08,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2018-04-13 04:06:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 04:06:08,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:08,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 04:06:08,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:06:08,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:06:08,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:06:08,783 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 13 states. [2018-04-13 04:06:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:08,946 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-04-13 04:06:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:06:08,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-04-13 04:06:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:08,946 INFO L225 Difference]: With dead ends: 69 [2018-04-13 04:06:08,946 INFO L226 Difference]: Without dead ends: 58 [2018-04-13 04:06:08,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:06:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-13 04:06:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-13 04:06:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:06:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-04-13 04:06:08,949 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 30 [2018-04-13 04:06:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:08,949 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-04-13 04:06:08,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:06:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-04-13 04:06:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:06:08,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:08,950 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:08,950 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:08,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1684146496, now seen corresponding path program 1 times [2018-04-13 04:06:08,950 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:08,950 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:08,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:08,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:08,959 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:09,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:09,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:09,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:09,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:09,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:09,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:06:09,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:09,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:09,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:09,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 04:06:09,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 04:06:09,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:06:09,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:09,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:06:09,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 04:06:09,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:06:09,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:09,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-13 04:06:09,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-13 04:06:09,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-13 04:06:09,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,402 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:06:09,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 04:06:09,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:09,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-13 04:06:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 04:06:09,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:09,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2018-04-13 04:06:09,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:06:09,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:06:09,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:06:09,435 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 23 states. [2018-04-13 04:06:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:10,109 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-04-13 04:06:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 04:06:10,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-04-13 04:06:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:10,111 INFO L225 Difference]: With dead ends: 90 [2018-04-13 04:06:10,111 INFO L226 Difference]: Without dead ends: 78 [2018-04-13 04:06:10,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 04:06:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-13 04:06:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-04-13 04:06:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:06:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-04-13 04:06:10,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 30 [2018-04-13 04:06:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:10,116 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-04-13 04:06:10,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:06:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-04-13 04:06:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 04:06:10,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:10,117 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:10,117 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 904755746, now seen corresponding path program 1 times [2018-04-13 04:06:10,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:10,117 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:10,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:10,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:10,125 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:10,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:10,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:06:10,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:06:10,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:06:10,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:06:10,179 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 10 states. [2018-04-13 04:06:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:10,298 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-04-13 04:06:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:06:10,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-13 04:06:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:10,299 INFO L225 Difference]: With dead ends: 62 [2018-04-13 04:06:10,299 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 04:06:10,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:06:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 04:06:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-04-13 04:06:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:06:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-04-13 04:06:10,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-04-13 04:06:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:10,302 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-04-13 04:06:10,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:06:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-04-13 04:06:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:06:10,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:10,303 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:10,303 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1068354497, now seen corresponding path program 1 times [2018-04-13 04:06:10,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:10,303 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:10,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:10,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:10,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:10,313 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:10,317 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:10,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:10,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:10,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:10,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 04:06:10,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:06:10,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:10,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-13 04:06:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:10,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:06:10,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 04:06:10,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:06:10,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:06:10,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:06:10,539 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2018-04-13 04:06:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:10,731 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-13 04:06:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:06:10,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-04-13 04:06:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:10,732 INFO L225 Difference]: With dead ends: 74 [2018-04-13 04:06:10,732 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 04:06:10,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:06:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 04:06:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 04:06:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:06:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-04-13 04:06:10,734 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2018-04-13 04:06:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:10,735 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-04-13 04:06:10,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:06:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-04-13 04:06:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:06:10,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:10,736 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:10,736 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1006314883, now seen corresponding path program 1 times [2018-04-13 04:06:10,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:10,736 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:10,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:10,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:10,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:10,746 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:10,750 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:10,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:10,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:10,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:10,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:10,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:10,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:06:10,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:10,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:10,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:10,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:06:10,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:06:10,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:06:10,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:10,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2018-04-13 04:06:10,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:06:10,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:10,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:10,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:10,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 04:06:12,763 WARN L148 SmtUtils]: Spent 1602ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-13 04:06:12,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-13 04:06:12,823 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 16 [2018-04-13 04:06:12,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:12,842 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 22 treesize of output 14 [2018-04-13 04:06:12,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:12,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:12,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:12,862 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:38 [2018-04-13 04:06:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:12,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:12,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:06:12,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:06:12,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:06:12,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:06:12,932 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 19 states. [2018-04-13 04:06:14,813 WARN L151 SmtUtils]: Spent 1492ms on a formula simplification. DAG size of input: 67 DAG size of output 67 [2018-04-13 04:06:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:15,750 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-04-13 04:06:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:06:15,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-13 04:06:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:15,751 INFO L225 Difference]: With dead ends: 126 [2018-04-13 04:06:15,751 INFO L226 Difference]: Without dead ends: 126 [2018-04-13 04:06:15,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 04:06:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-13 04:06:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 72. [2018-04-13 04:06:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-13 04:06:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-13 04:06:15,753 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 33 [2018-04-13 04:06:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:15,753 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-13 04:06:15,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:06:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-13 04:06:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 04:06:15,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:15,754 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:15,754 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1684275054, now seen corresponding path program 1 times [2018-04-13 04:06:15,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:15,754 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:15,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:15,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:15,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:15,764 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:15,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:15,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:15,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:15,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:15,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:15,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:15,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:15,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:06:16,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:06:16,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:06:16,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:06:16,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:06:16,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:16,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:16,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:16,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-04-13 04:06:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:16,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:06:16,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-04-13 04:06:16,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:06:16,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:06:16,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:06:16,265 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 23 states. [2018-04-13 04:06:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:16,796 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-04-13 04:06:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:06:16,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-04-13 04:06:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:16,797 INFO L225 Difference]: With dead ends: 101 [2018-04-13 04:06:16,797 INFO L226 Difference]: Without dead ends: 99 [2018-04-13 04:06:16,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:06:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-13 04:06:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2018-04-13 04:06:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 04:06:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-13 04:06:16,799 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 37 [2018-04-13 04:06:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:16,799 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-13 04:06:16,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:06:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-13 04:06:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 04:06:16,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:16,800 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:16,800 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1899050611, now seen corresponding path program 1 times [2018-04-13 04:06:16,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:16,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:16,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:16,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:16,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:16,806 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:16,808 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:16,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:16,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:16,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:16,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:16,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:16,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:16,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:06:16,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:16,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:16,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:16,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:06:16,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:06:16,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:06:16,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:16,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 04:06:16,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:06:16,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:16,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:16,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:16,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 04:06:19,193 WARN L148 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-13 04:06:19,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-13 04:06:19,233 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 22 treesize of output 14 [2018-04-13 04:06:19,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:19,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:06:19,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:19,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:19,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:19,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:62 [2018-04-13 04:06:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 04:06:19,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:19,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:06:19,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:06:19,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:06:19,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:06:19,341 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 20 states. [2018-04-13 04:06:22,317 WARN L151 SmtUtils]: Spent 2564ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-13 04:06:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:24,897 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2018-04-13 04:06:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:06:24,897 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-04-13 04:06:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:24,898 INFO L225 Difference]: With dead ends: 152 [2018-04-13 04:06:24,898 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 04:06:24,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:06:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 04:06:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 101. [2018-04-13 04:06:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 04:06:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-13 04:06:24,900 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 40 [2018-04-13 04:06:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:24,900 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-13 04:06:24,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:06:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-13 04:06:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 04:06:24,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:24,902 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:24,902 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash -880810370, now seen corresponding path program 2 times [2018-04-13 04:06:24,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:24,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:24,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:24,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:06:24,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:24,910 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 04:06:25,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:25,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:25,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:06:25,026 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:06:25,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:06:25,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:25,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:25,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:06:25,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:06:25,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:06:25,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-13 04:06:25,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:06:25,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:06:25,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:25,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:25,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:25,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:06:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:25,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:06:25,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2018-04-13 04:06:25,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:06:25,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:06:25,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:06:25,179 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 21 states. [2018-04-13 04:06:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:25,755 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-13 04:06:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:06:25,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-13 04:06:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:25,756 INFO L225 Difference]: With dead ends: 135 [2018-04-13 04:06:25,756 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 04:06:25,756 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=1197, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:06:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 04:06:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 52. [2018-04-13 04:06:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:06:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-04-13 04:06:25,759 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-04-13 04:06:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:25,759 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-04-13 04:06:25,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:06:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-04-13 04:06:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 04:06:25,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:25,760 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:25,760 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:25,760 INFO L82 PathProgramCache]: Analyzing trace with hash 918606443, now seen corresponding path program 2 times [2018-04-13 04:06:25,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:25,760 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:25,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:25,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:06:25,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:25,773 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:25,777 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:25,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:25,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:06:25,811 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:06:25,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:06:25,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:25,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:25,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:25,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:06:25,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:25,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-13 04:06:25,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:25,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:25,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:25,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:06:25,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:06:25,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:25,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-13 04:06:25,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:06:25,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:25,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:25,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-04-13 04:06:26,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-04-13 04:06:26,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:26,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-04-13 04:06:26,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:26,433 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:06:26,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-04-13 04:06:26,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:26,435 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:06:26,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-13 04:06:26,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:26,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:26,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-13 04:06:26,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:99, output treesize:145 [2018-04-13 04:06:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:06:26,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:26,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 04:06:26,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 04:06:26,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 04:06:26,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:06:26,707 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 25 states. [2018-04-13 04:06:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:28,088 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-04-13 04:06:28,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 04:06:28,088 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-04-13 04:06:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:28,089 INFO L225 Difference]: With dead ends: 102 [2018-04-13 04:06:28,089 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 04:06:28,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:06:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 04:06:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2018-04-13 04:06:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-13 04:06:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-13 04:06:28,091 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 48 [2018-04-13 04:06:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:28,091 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-13 04:06:28,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 04:06:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-13 04:06:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 04:06:28,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:28,092 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:28,092 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2035722719, now seen corresponding path program 2 times [2018-04-13 04:06:28,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:28,093 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:28,093 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:28,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:06:28,093 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:28,103 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:28,108 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:28,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:28,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:28,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:06:28,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:06:28,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:06:28,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:28,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:28,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:28,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:06:28,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:28,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:06:28,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:28,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:28,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:28,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:06:28,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:06:28,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:28,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-13 04:06:28,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:06:28,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:28,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:28,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:28,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-13 04:06:32,329 WARN L148 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-13 04:06:32,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-13 04:06:32,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:06:32,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:32,387 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 22 treesize of output 14 [2018-04-13 04:06:32,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:32,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:32,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:06:32,405 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-04-13 04:06:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 04:06:32,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:32,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 04:06:32,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:06:32,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:06:32,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:06:32,496 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 23 states. [2018-04-13 04:06:37,091 WARN L151 SmtUtils]: Spent 4093ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-13 04:06:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:37,492 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-04-13 04:06:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 04:06:37,492 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-04-13 04:06:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:37,493 INFO L225 Difference]: With dead ends: 107 [2018-04-13 04:06:37,493 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 04:06:37,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:06:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 04:06:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 67. [2018-04-13 04:06:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 04:06:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-04-13 04:06:37,496 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 55 [2018-04-13 04:06:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:37,496 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-04-13 04:06:37,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:06:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-04-13 04:06:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 04:06:37,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:06:37,497 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:06:37,497 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:06:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash 156516541, now seen corresponding path program 3 times [2018-04-13 04:06:37,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:06:37,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:06:37,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:37,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:06:37,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:06:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:06:37,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:06:37,518 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:06:37,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:06:37,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:06:37,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:06:37,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:06:37,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:06:37,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:06:37,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:37,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:06:37,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:06:37,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:37,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:06:37,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:06:37,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:06:37,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:06:37,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:06:37,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:06:37,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:06:37,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:06:37,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:06:37,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:06:37,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:06:37,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 04:06:40,174 WARN L148 SmtUtils]: Spent 2041ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-13 04:06:40,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-13 04:06:40,212 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 44 treesize of output 34 [2018-04-13 04:06:40,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,248 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 44 treesize of output 42 [2018-04-13 04:06:40,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:40,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-04-13 04:06:40,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-13 04:06:40,356 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 38 treesize of output 28 [2018-04-13 04:06:40,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,358 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 33 treesize of output 23 [2018-04-13 04:06:40,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,426 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 40 treesize of output 38 [2018-04-13 04:06:40,426 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 04:06:40,484 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 28 treesize of output 21 [2018-04-13 04:06:40,484 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,485 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 23 treesize of output 16 [2018-04-13 04:06:40,486 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-04-13 04:06:40,554 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-13 04:06:40,622 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 34 treesize of output 26 [2018-04-13 04:06:40,622 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-13 04:06:40,624 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 04:06:40,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 04:06:40,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:06:40,705 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-04-13 04:06:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-13 04:06:40,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:06:40,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:06:40,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:06:40,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:06:40,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:06:40,779 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 19 states. [2018-04-13 04:06:45,192 WARN L151 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-04-13 04:06:46,553 WARN L151 SmtUtils]: Spent 915ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-13 04:06:50,690 WARN L151 SmtUtils]: Spent 4072ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-13 04:06:51,691 WARN L151 SmtUtils]: Spent 902ms on a formula simplification. DAG size of input: 52 DAG size of output 45 [2018-04-13 04:06:53,879 WARN L151 SmtUtils]: Spent 2047ms on a formula simplification. DAG size of input: 52 DAG size of output 46 [2018-04-13 04:06:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:06:53,886 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-04-13 04:06:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 04:06:53,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-04-13 04:06:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:06:53,887 INFO L225 Difference]: With dead ends: 65 [2018-04-13 04:06:53,887 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 04:06:53,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=352, Invalid=1628, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:06:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 04:06:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 04:06:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 04:06:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 04:06:53,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-04-13 04:06:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:06:53,888 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 04:06:53,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:06:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 04:06:53,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 04:06:53,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:06:53 BoogieIcfgContainer [2018-04-13 04:06:53,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:06:53,893 INFO L168 Benchmark]: Toolchain (without parser) took 47725.77 ms. Allocated memory was 405.3 MB in the beginning and 817.9 MB in the end (delta: 412.6 MB). Free memory was 341.6 MB in the beginning and 508.3 MB in the end (delta: -166.7 MB). Peak memory consumption was 245.9 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:53,894 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 405.3 MB. Free memory is still 368.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:06:53,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.09 ms. Allocated memory is still 405.3 MB. Free memory was 340.3 MB in the beginning and 316.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:53,894 INFO L168 Benchmark]: Boogie Preprocessor took 40.20 ms. Allocated memory is still 405.3 MB. Free memory was 316.5 MB in the beginning and 315.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:53,894 INFO L168 Benchmark]: RCFGBuilder took 354.14 ms. Allocated memory was 405.3 MB in the beginning and 613.9 MB in the end (delta: 208.7 MB). Free memory was 313.8 MB in the beginning and 547.5 MB in the end (delta: -233.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:53,894 INFO L168 Benchmark]: TraceAbstraction took 47063.93 ms. Allocated memory was 613.9 MB in the beginning and 817.9 MB in the end (delta: 203.9 MB). Free memory was 547.5 MB in the beginning and 508.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 243.2 MB. Max. memory is 5.3 GB. [2018-04-13 04:06:53,895 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 405.3 MB. Free memory is still 368.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 265.09 ms. Allocated memory is still 405.3 MB. Free memory was 340.3 MB in the beginning and 316.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 40.20 ms. Allocated memory is still 405.3 MB. Free memory was 316.5 MB in the beginning and 315.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 354.14 ms. Allocated memory was 405.3 MB in the beginning and 613.9 MB in the end (delta: 208.7 MB). Free memory was 313.8 MB in the beginning and 547.5 MB in the end (delta: -233.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47063.93 ms. Allocated memory was 613.9 MB in the beginning and 817.9 MB in the end (delta: 203.9 MB). Free memory was 547.5 MB in the beginning and 508.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 243.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 15 error locations. SAFE Result, 47.0s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 30.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 825 SDtfs, 1824 SDslu, 3721 SDs, 0 SdLazy, 4753 SolverSat, 274 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 739 GetRequests, 313 SyntacticMatches, 8 SemanticMatches, 418 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2171 ImplicationChecksByTransitivity, 38.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 353 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 735 ConstructedInterpolants, 186 QuantifiedInterpolants, 565960 SizeOfPredicates, 160 NumberOfNonLiveVariables, 2007 ConjunctsInSsa, 467 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 83/202 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-06-53-900.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-06-53-900.csv Received shutdown request...