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-666feb3-m [2018-04-11 15:10:37,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:10:37,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:10:37,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:10:37,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:10:37,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:10:37,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:10:37,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:10:37,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:10:37,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:10:37,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:10:37,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:10:37,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:10:37,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:10:37,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:10:37,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:10:37,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:10:37,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:10:37,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:10:37,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:10:37,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:10:37,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:10:37,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:10:37,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:10:37,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:10:37,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:10:37,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:10:37,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:10:37,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:10:37,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:10:37,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:10:37,831 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:10:37,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:10:37,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:10:37,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:10:37,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:10:37,854 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:10:37,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:10:37,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:10:37,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:10:37,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:10:37,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:10:37,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:10:37,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:10:37,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:10:37,856 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:10:37,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:10:37,856 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:10:37,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:10:37,890 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:10:37,893 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:10:37,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:10:37,894 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:10:37,895 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-11 15:10:38,194 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ffef4de8 [2018-04-11 15:10:38,343 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:10:38,344 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:10:38,344 INFO L168 CDTParser]: Scanning cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:10:38,351 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:10:38,351 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:10:38,352 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:10:38,352 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-11 15:10:38,352 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-11 15:10:38,352 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:10:38,352 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-11 15:10:38,352 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:10:38,352 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-11 15:10:38,352 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-11 15:10:38,352 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-11 15:10:38,352 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-11 15:10:38,352 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-11 15:10:38,352 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,353 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,354 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,355 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,356 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,357 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,358 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,359 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,360 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,361 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-11 15:10:38,375 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ffef4de8 [2018-04-11 15:10:38,377 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:10:38,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:10:38,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:10:38,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:10:38,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:10:38,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a77ade1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38, skipping insertion in model container [2018-04-11 15:10:38,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,396 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:10:38,418 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:10:38,541 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:10:38,572 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:10:38,578 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:10:38,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38 WrapperNode [2018-04-11 15:10:38,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:10:38,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:10:38,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:10:38,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:10:38,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... [2018-04-11 15:10:38,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:10:38,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:10:38,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:10:38,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:10:38,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:10:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:10:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:10:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:10:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:10:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-04-11 15:10:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:10:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:10:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrpbrk_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:10:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:10:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:10:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:10:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:10:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:10:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:10:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:10:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:10:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:10:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:10:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:10:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:10:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:10:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:10:38,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:10:38,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:10:38,755 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:10:39,023 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:10:39,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:10:39 BoogieIcfgContainer [2018-04-11 15:10:39,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:10:39,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:10:39,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:10:39,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:10:39,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:10:38" (1/3) ... [2018-04-11 15:10:39,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a788a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:10:39, skipping insertion in model container [2018-04-11 15:10:39,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:10:38" (2/3) ... [2018-04-11 15:10:39,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a788a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:10:39, skipping insertion in model container [2018-04-11 15:10:39,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:10:39" (3/3) ... [2018-04-11 15:10:39,028 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:10:39,034 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:10:39,039 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 15:10:39,069 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:10:39,069 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:10:39,069 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:10:39,069 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:10:39,069 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:10:39,069 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:10:39,070 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:10:39,070 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:10:39,070 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:10:39,070 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:10:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-04-11 15:10:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:10:39,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:39,083 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:39,083 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1596208369, now seen corresponding path program 1 times [2018-04-11 15:10:39,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:39,087 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:39,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:39,174 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:39,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:39,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:39,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:39,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:10:39,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:10:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:39,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:10:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:39,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:39,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:10:39,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:10:39,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:10:39,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:10:39,321 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 5 states. [2018-04-11 15:10:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:39,420 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-11 15:10:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:10:39,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:10:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:39,427 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:10:39,427 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:10:39,428 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-11 15:10:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:10:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:10:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:10:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 15:10:39,451 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-04-11 15:10:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:39,451 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 15:10:39,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:10:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 15:10:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:10:39,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:39,452 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:39,452 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1596208368, now seen corresponding path program 1 times [2018-04-11 15:10:39,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:39,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:39,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:39,472 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:39,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:39,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:39,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:39,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:39,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:10:39,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:39,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:39,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:39,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:39,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:10:39,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:10:39,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:10:39,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:10:39,611 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-04-11 15:10:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:39,657 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-04-11 15:10:39,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:10:39,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:10:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:39,659 INFO L225 Difference]: With dead ends: 71 [2018-04-11 15:10:39,660 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 15:10:39,660 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-11 15:10:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 15:10:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2018-04-11 15:10:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:10:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-04-11 15:10:39,669 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2018-04-11 15:10:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:39,670 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-04-11 15:10:39,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:10:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-04-11 15:10:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:10:39,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:39,671 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:39,671 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:39,671 INFO L82 PathProgramCache]: Analyzing trace with hash 178798994, now seen corresponding path program 1 times [2018-04-11 15:10:39,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:39,671 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:39,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:39,687 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:39,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:39,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:39,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:39,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:39,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:39,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:10:39,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:39,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:39,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:39,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:39,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:10:39,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:10:39,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:10:39,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:10:39,781 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-04-11 15:10:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:39,856 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-04-11 15:10:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:10:39,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:10:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:39,857 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:10:39,857 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:10:39,857 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-11 15:10:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:10:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-04-11 15:10:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:10:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-11 15:10:39,861 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-04-11 15:10:39,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:39,862 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-11 15:10:39,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:10:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-11 15:10:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:10:39,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:39,862 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:39,862 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:39,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2057148167, now seen corresponding path program 1 times [2018-04-11 15:10:39,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:39,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:39,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:39,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:39,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:10:39,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:10:39,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:10:39,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:10:39,896 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-04-11 15:10:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:39,928 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-04-11 15:10:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:10:39,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:10:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:39,929 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:10:39,929 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:10:39,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:10:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:10:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 15:10:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:10:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 15:10:39,932 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-04-11 15:10:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:39,932 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 15:10:39,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:10:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 15:10:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:10:39,933 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:39,933 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:39,933 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:39,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2057148168, now seen corresponding path program 1 times [2018-04-11 15:10:39,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:39,934 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:39,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:39,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:39,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:39,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:10:39,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:10:39,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:10:39,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:10:39,997 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-04-11 15:10:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,020 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-11 15:10:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:10:40,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:10:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,021 INFO L225 Difference]: With dead ends: 51 [2018-04-11 15:10:40,021 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:10:40,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:10:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:10:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:10:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:10:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 15:10:40,025 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-04-11 15:10:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,025 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 15:10:40,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:10:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 15:10:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:10:40,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,026 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-11 15:10:40,026 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 880492650, now seen corresponding path program 1 times [2018-04-11 15:10:40,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,026 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:40,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:10:40,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:10:40,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:10:40,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:10:40,060 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-04-11 15:10:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,104 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 15:10:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:10:40,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 15:10:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,105 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:10:40,105 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:10:40,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:10:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:10:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 15:10:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 15:10:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 15:10:40,108 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-04-11 15:10:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,108 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 15:10:40,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:10:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 15:10:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:10:40,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,109 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-11 15:10:40,109 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 880492651, now seen corresponding path program 1 times [2018-04-11 15:10:40,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,109 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:40,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:10:40,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:10:40,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:10:40,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:10:40,185 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-04-11 15:10:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,255 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-04-11 15:10:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:10:40,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 15:10:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,257 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:10:40,257 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:10:40,257 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-11 15:10:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:10:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-04-11 15:10:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:10:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-04-11 15:10:40,260 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-04-11 15:10:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,260 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-04-11 15:10:40,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:10:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-04-11 15:10:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:10:40,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,260 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-11 15:10:40,260 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1252202925, now seen corresponding path program 1 times [2018-04-11 15:10:40,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:40,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:10:40,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:10:40,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:10:40,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:10:40,293 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-04-11 15:10:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,344 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-04-11 15:10:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:10:40,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 15:10:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,345 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:10:40,345 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:10:40,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:10:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:10:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-11 15:10:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:10:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-04-11 15:10:40,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-04-11 15:10:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,347 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-04-11 15:10:40,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:10:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-04-11 15:10:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:10:40,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,348 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-11 15:10:40,348 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1252202926, now seen corresponding path program 1 times [2018-04-11 15:10:40,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,348 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:40,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:10:40,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:10:40,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:10:40,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:10:40,407 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-04-11 15:10:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,501 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-04-11 15:10:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:10:40,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-04-11 15:10:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,501 INFO L225 Difference]: With dead ends: 67 [2018-04-11 15:10:40,502 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 15:10:40,502 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-11 15:10:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 15:10:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-04-11 15:10:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:10:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-04-11 15:10:40,504 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-04-11 15:10:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,504 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-04-11 15:10:40,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:10:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-04-11 15:10:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:10:40,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,505 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-11 15:10:40,506 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1282364997, now seen corresponding path program 1 times [2018-04-11 15:10:40,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,506 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,528 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-11 15:10:40,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:10:40,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:10:40,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:10:40,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:10:40,529 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-04-11 15:10:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,533 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-04-11 15:10:40,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:10:40,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-11 15:10:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,535 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:10:40,535 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 15:10:40,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:10:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 15:10:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-11 15:10:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:10:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-04-11 15:10:40,539 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-04-11 15:10:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,539 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-04-11 15:10:40,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:10:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-04-11 15:10:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:10:40,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,540 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-11 15:10:40,540 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1110592865, now seen corresponding path program 1 times [2018-04-11 15:10:40,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,540 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,552 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:40,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:40,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:40,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:40,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:40,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 15:10:40,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:40,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:10:40,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:40,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:10:40,629 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-11 15:10:40,635 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-11 15:10:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:40,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:10:40,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:10:40,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:10:40,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:10:40,638 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 8 states. [2018-04-11 15:10:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:40,726 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-04-11 15:10:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:10:40,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:10:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:40,727 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:10:40,727 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:10:40,727 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-11 15:10:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:10:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 15:10:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:10:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-04-11 15:10:40,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-04-11 15:10:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:40,729 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-04-11 15:10:40,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:10:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-04-11 15:10:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:10:40,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:40,729 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-11 15:10:40,729 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash 121291838, now seen corresponding path program 1 times [2018-04-11 15:10:40,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:40,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:40,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:40,743 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:40,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:40,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:40,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:40,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:40,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 15:10:40,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:10:40,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:40,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:10:40,874 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-11 15:10:40,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:10:40,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:40,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-04-11 15:10:40,952 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-11 15:10:40,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:10:40,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 15:10:40,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:40,963 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-11 15:10:40,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2018-04-11 15:10:40,971 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-11 15:10:40,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:40,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:10:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:10:40,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:10:40,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:10:40,972 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 13 states. [2018-04-11 15:10:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:41,104 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-04-11 15:10:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:10:41,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-04-11 15:10:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:41,105 INFO L225 Difference]: With dead ends: 69 [2018-04-11 15:10:41,105 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 15:10:41,105 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-11 15:10:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 15:10:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-11 15:10:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:10:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-04-11 15:10:41,107 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 30 [2018-04-11 15:10:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:41,107 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-04-11 15:10:41,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:10:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-04-11 15:10:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:10:41,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:41,108 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-11 15:10:41,108 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:41,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1684146496, now seen corresponding path program 1 times [2018-04-11 15:10:41,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:41,108 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:41,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:41,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:41,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:41,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:41,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:41,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:41,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:41,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:41,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:41,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:10:41,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:41,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:41,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:41,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:10:41,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:10:41,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:10:41,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:41,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:10:41,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:10:41,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:10:41,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:41,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-11 15:10:41,541 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-11 15:10:41,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-11 15:10:41,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,556 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:10:41,557 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-11 15:10:41,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,568 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-11 15:10:41,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-11 15:10:41,583 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-11 15:10:41,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:41,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2018-04-11 15:10:41,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:10:41,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:10:41,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:10:41,584 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 23 states. [2018-04-11 15:10:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:42,217 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-04-11 15:10:42,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:10:42,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-04-11 15:10:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:42,218 INFO L225 Difference]: With dead ends: 90 [2018-04-11 15:10:42,218 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:10:42,219 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-11 15:10:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:10:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-04-11 15:10:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:10:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-04-11 15:10:42,221 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 30 [2018-04-11 15:10:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:42,222 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-04-11 15:10:42,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:10:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-04-11 15:10:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:10:42,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:42,222 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-11 15:10:42,222 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:42,223 INFO L82 PathProgramCache]: Analyzing trace with hash 904755746, now seen corresponding path program 1 times [2018-04-11 15:10:42,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:42,223 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:42,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:42,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:42,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:42,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:42,282 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-11 15:10:42,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:42,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:10:42,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:10:42,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:10:42,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:10:42,283 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 10 states. [2018-04-11 15:10:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:42,397 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-04-11 15:10:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:10:42,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-11 15:10:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:42,397 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:10:42,397 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:10:42,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:10:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-04-11 15:10:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:10:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-04-11 15:10:42,399 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-04-11 15:10:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:42,399 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-04-11 15:10:42,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:10:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-04-11 15:10:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:10:42,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:42,400 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-11 15:10:42,400 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1068354497, now seen corresponding path program 1 times [2018-04-11 15:10:42,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:42,400 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:42,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:42,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:42,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:42,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:42,418 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:42,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:42,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:42,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:42,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:42,456 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-11 15:10:42,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:10:42,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:42,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:42,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:42,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 15:10:42,645 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-11 15:10:42,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:10:42,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:10:42,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:10:42,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:10:42,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:10:42,649 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2018-04-11 15:10:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:42,910 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-11 15:10:42,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:10:42,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-04-11 15:10:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:42,910 INFO L225 Difference]: With dead ends: 74 [2018-04-11 15:10:42,910 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:10:42,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:10:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:10:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 15:10:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:10:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-04-11 15:10:42,912 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2018-04-11 15:10:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:42,912 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-04-11 15:10:42,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:10:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-04-11 15:10:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:10:42,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:42,913 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-11 15:10:42,913 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1006314883, now seen corresponding path program 1 times [2018-04-11 15:10:42,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:42,913 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:42,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:42,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:42,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:42,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:42,931 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:42,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:42,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:42,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:42,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:42,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:42,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:42,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:42,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:42,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:42,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:42,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:43,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:43,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:43,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:10:43,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:10:43,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:43,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2018-04-11 15:10:43,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:10:43,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:43,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:43,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:10:44,719 WARN L148 SmtUtils]: Spent 1510ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-11 15:10:44,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 15:10:44,763 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-11 15:10:44,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:44,772 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-11 15:10:44,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:44,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:44,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:44,787 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:38 [2018-04-11 15:10:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:44,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:44,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:10:44,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:10:44,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:10:44,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:44,840 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 19 states. [2018-04-11 15:10:46,675 WARN L151 SmtUtils]: Spent 1467ms on a formula simplification. DAG size of input: 67 DAG size of output 67 [2018-04-11 15:10:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:47,612 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-04-11 15:10:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:10:47,613 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-11 15:10:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:47,613 INFO L225 Difference]: With dead ends: 126 [2018-04-11 15:10:47,613 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 15:10:47,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:10:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 15:10:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 72. [2018-04-11 15:10:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:10:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-11 15:10:47,615 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 33 [2018-04-11 15:10:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:47,616 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-11 15:10:47,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:10:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-11 15:10:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:10:47,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:47,616 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-11 15:10:47,616 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1684275054, now seen corresponding path program 1 times [2018-04-11 15:10:47,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:47,617 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:47,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:47,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:47,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:47,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:47,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:47,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:47,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:47,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:47,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:47,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:10:47,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:10:47,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:47,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:10:48,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:10:48,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:10:48,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:48,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:48,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:48,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-04-11 15:10:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:48,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:10:48,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-04-11 15:10:48,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:10:48,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:10:48,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:10:48,118 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 23 states. [2018-04-11 15:10:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:48,657 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-04-11 15:10:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:10:48,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-04-11 15:10:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:48,658 INFO L225 Difference]: With dead ends: 101 [2018-04-11 15:10:48,658 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 15:10:48,658 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-11 15:10:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 15:10:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2018-04-11 15:10:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:10:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-11 15:10:48,660 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 37 [2018-04-11 15:10:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:48,661 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-11 15:10:48,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:10:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-11 15:10:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:10:48,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:48,662 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-11 15:10:48,662 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1899050611, now seen corresponding path program 1 times [2018-04-11 15:10:48,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:48,662 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:48,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:48,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:48,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:48,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:48,677 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:48,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:48,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:48,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:48,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:48,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:48,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:48,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:48,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:48,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:48,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:48,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:10:48,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:10:48,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:48,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 15:10:48,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:10:48,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:48,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:48,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:10:51,087 WARN L148 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 15:10:51,140 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-11 15:10:51,142 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-11 15:10:51,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:51,151 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-11 15:10:51,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:51,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:51,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:51,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:62 [2018-04-11 15:10:51,241 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-11 15:10:51,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:51,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:10:51,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:10:51,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:10:51,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:10:51,257 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 20 states. [2018-04-11 15:10:53,033 WARN L151 SmtUtils]: Spent 1323ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-11 15:10:54,790 WARN L151 SmtUtils]: Spent 914ms on a formula simplification. DAG size of input: 66 DAG size of output 66 [2018-04-11 15:10:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:56,170 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-04-11 15:10:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:10:56,170 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-04-11 15:10:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:56,171 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:10:56,171 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:10:56,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:10:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:10:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 101. [2018-04-11 15:10:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:10:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-11 15:10:56,174 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 40 [2018-04-11 15:10:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:56,174 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-11 15:10:56,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:10:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-11 15:10:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:10:56,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:56,175 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-11 15:10:56,175 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash -880810370, now seen corresponding path program 2 times [2018-04-11 15:10:56,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:56,175 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:56,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:56,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:56,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:56,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:56,313 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-11 15:10:56,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:56,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:56,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:56,340 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:56,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:56,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:56,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:56,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:56,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:56,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:10:56,358 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-11 15:10:56,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:10:56,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:56,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:56,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:56,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 15:10:56,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:10:56,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:10:56,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:56,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:56,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:56,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:10:56,519 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-11 15:10:56,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:10:56,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2018-04-11 15:10:56,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:10:56,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:10:56,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:10:56,520 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 21 states. [2018-04-11 15:10:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:57,081 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-11 15:10:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:10:57,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-11 15:10:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:57,082 INFO L225 Difference]: With dead ends: 135 [2018-04-11 15:10:57,082 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:10:57,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1197, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:10:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:10:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 52. [2018-04-11 15:10:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:10:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-04-11 15:10:57,085 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-04-11 15:10:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:57,085 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-04-11 15:10:57,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:10:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-04-11 15:10:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:10:57,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:57,086 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-11 15:10:57,086 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash 918606443, now seen corresponding path program 2 times [2018-04-11 15:10:57,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:57,086 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:57,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:57,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:57,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:57,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:57,106 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:57,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:57,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:57,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:57,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:57,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:57,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:57,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:57,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:57,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:57,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:57,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:57,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:57,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:57,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:10:57,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:10:57,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:57,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-11 15:10:57,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:10:57,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:57,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-04-11 15:10:57,931 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-11 15:10:57,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:57,942 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-11 15:10:57,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:57,968 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:10:57,969 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-11 15:10:57,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,972 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:10:57,973 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-11 15:10:57,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:57,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:10:58,028 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-11 15:10:58,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:99, output treesize:145 [2018-04-11 15:10:58,283 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-11 15:10:58,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:58,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:10:58,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:10:58,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:10:58,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:10:58,284 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 25 states. [2018-04-11 15:10:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:59,754 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-04-11 15:10:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:10:59,754 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-04-11 15:10:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:59,754 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:10:59,754 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:10:59,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:10:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:10:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2018-04-11 15:10:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 15:10:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-11 15:10:59,756 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 48 [2018-04-11 15:10:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:59,756 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-11 15:10:59,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:10:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-11 15:10:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:10:59,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:59,757 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-11 15:10:59,757 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2035722719, now seen corresponding path program 2 times [2018-04-11 15:10:59,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:59,758 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:59,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:59,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:59,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:59,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:59,772 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:59,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:59,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:59,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:59,791 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:59,791 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:59,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:59,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:59,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:59,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:10:59,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:59,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:59,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:59,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:59,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:59,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:10:59,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:10:59,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-11 15:10:59,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-11 15:10:59,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:10:59,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:10:59,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:59,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 15:11:02,243 WARN L148 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-11 15:11:02,285 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-11 15:11:02,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:11:02,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:02,303 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-11 15:11:02,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:02,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:02,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:02,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-04-11 15:11:02,406 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-11 15:11:02,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:02,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:11:02,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:11:02,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:11:02,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:11:02,407 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 23 states. [2018-04-11 15:11:04,131 WARN L151 SmtUtils]: Spent 1233ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-11 15:11:09,008 WARN L151 SmtUtils]: Spent 4066ms on a formula simplification. DAG size of input: 59 DAG size of output 59 [2018-04-11 15:11:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:09,315 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-04-11 15:11:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:11:09,316 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-04-11 15:11:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:09,316 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:11:09,316 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:11:09,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=346, Invalid=2204, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:11:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:11:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 67. [2018-04-11 15:11:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:11:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-04-11 15:11:09,318 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 55 [2018-04-11 15:11:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:09,319 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-04-11 15:11:09,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:11:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-04-11 15:11:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 15:11:09,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:09,320 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-11 15:11:09,320 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 156516541, now seen corresponding path program 3 times [2018-04-11 15:11:09,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:09,320 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:09,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:09,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:09,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:09,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:09,365 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:09,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:09,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:09,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:11:09,396 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:11:09,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:09,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:09,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:09,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:09,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:09,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:09,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:09,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:11:09,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:09,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:11:09,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:11:09,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:11:09,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:11:09,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 15:11:09,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:09,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:09,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:09,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 15:11:12,634 WARN L148 SmtUtils]: Spent 830ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-11 15:11:12,672 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-11 15:11:12,674 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-11 15:11:12,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:12,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-04-11 15:11:12,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:12,757 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-11 15:11:12,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-11 15:11:12,825 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-11 15:11:12,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:12,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 15:11:12,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:12,878 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-11 15:11:12,879 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:12,934 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-11 15:11:12,934 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:12,935 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-11 15:11:12,935 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:12,995 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-11 15:11:12,995 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-11 15:11:13,054 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-11 15:11:13,054 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,055 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-11 15:11:13,056 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 15:11:13,132 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-11 15:11:13,132 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-04-11 15:11:13,203 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-11 15:11:13,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:13,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:11:13,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:11:13,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:11:13,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:11:13,204 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 19 states. [2018-04-11 15:11:17,581 WARN L151 SmtUtils]: Spent 4059ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-04-11 15:11:19,770 WARN L151 SmtUtils]: Spent 829ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-11 15:11:23,911 WARN L151 SmtUtils]: Spent 4061ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-11 15:11:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:24,232 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-04-11 15:11:24,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:11:24,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-04-11 15:11:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:24,233 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:11:24,233 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 15:11:24,234 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=351, Invalid=1628, Unknown=1, NotChecked=0, Total=1980 [2018-04-11 15:11:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 15:11:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 15:11:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 15:11:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 15:11:24,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-04-11 15:11:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:24,234 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 15:11:24,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:11:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 15:11:24,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 15:11:24,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:11:24 BoogieIcfgContainer [2018-04-11 15:11:24,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:11:24,238 INFO L168 Benchmark]: Toolchain (without parser) took 45860.07 ms. Allocated memory was 401.6 MB in the beginning and 838.9 MB in the end (delta: 437.3 MB). Free memory was 333.6 MB in the beginning and 767.6 MB in the end (delta: -434.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:24,239 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:11:24,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.05 ms. Allocated memory is still 401.6 MB. Free memory was 332.3 MB in the beginning and 307.7 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:24,239 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 ms. Allocated memory is still 401.6 MB. Free memory was 307.7 MB in the beginning and 306.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:24,239 INFO L168 Benchmark]: RCFGBuilder took 369.27 ms. Allocated memory was 401.6 MB in the beginning and 610.8 MB in the end (delta: 209.2 MB). Free memory was 306.4 MB in the beginning and 544.5 MB in the end (delta: -238.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:24,239 INFO L168 Benchmark]: TraceAbstraction took 45213.38 ms. Allocated memory was 610.8 MB in the beginning and 838.9 MB in the end (delta: 228.1 MB). Free memory was 544.5 MB in the beginning and 767.6 MB in the end (delta: -223.1 MB). Peak memory consumption was 4.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:24,240 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.14 ms. Allocated memory is still 401.6 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.05 ms. Allocated memory is still 401.6 MB. Free memory was 332.3 MB in the beginning and 307.7 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.84 ms. Allocated memory is still 401.6 MB. Free memory was 307.7 MB in the beginning and 306.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 369.27 ms. Allocated memory was 401.6 MB in the beginning and 610.8 MB in the end (delta: 209.2 MB). Free memory was 306.4 MB in the beginning and 544.5 MB in the end (delta: -238.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45213.38 ms. Allocated memory was 610.8 MB in the beginning and 838.9 MB in the end (delta: 228.1 MB). Free memory was 544.5 MB in the beginning and 767.6 MB in the end (delta: -223.1 MB). Peak memory consumption was 4.9 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, 45.1s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 823 SDtfs, 1888 SDslu, 3600 SDs, 0 SdLazy, 4632 SolverSat, 288 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 312 SyntacticMatches, 8 SemanticMatches, 435 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 36.5s 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, 361 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.3s 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-11_15-11-24-247.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-11_15-11-24-247.csv Received shutdown request...