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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 10:08:39,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 10:08:39,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 10:08:39,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 10:08:39,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 10:08:39,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 10:08:39,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 10:08:39,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 10:08:39,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 10:08:39,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 10:08:39,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 10:08:39,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 10:08:39,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 10:08:39,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 10:08:39,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 10:08:39,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 10:08:39,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 10:08:39,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 10:08:39,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 10:08:39,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 10:08:39,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 10:08:39,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 10:08:39,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 10:08:39,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 10:08:39,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 10:08:39,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 10:08:39,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 10:08:39,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 10:08:39,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 10:08:39,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 10:08:39,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 10:08:39,821 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 10:08:39,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 10:08:39,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 10:08:39,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 10:08:39,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 10:08:39,841 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 10:08:39,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 10:08:39,842 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 10:08:39,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:08:39,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 10:08:39,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 10:08:39,844 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 10:08:39,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 10:08:39,878 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 10:08:39,880 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 10:08:39,881 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 10:08:39,882 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 10:08:39,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,251 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG74414777f [2018-04-11 10:08:40,374 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 10:08:40,374 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 10:08:40,375 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,383 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 10:08:40,383 INFO L215 ultiparseSymbolTable]: [2018-04-11 10:08:40,383 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 10:08:40,383 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,383 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,383 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,384 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,385 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,386 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:40,405 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG74414777f [2018-04-11 10:08:40,409 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 10:08:40,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 10:08:40,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 10:08:40,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 10:08:40,420 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 10:08:40,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234efc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40, skipping insertion in model container [2018-04-11 10:08:40,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,435 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:08:40,458 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:08:40,603 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:08:40,639 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:08:40,645 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 10:08:40,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40 WrapperNode [2018-04-11 10:08:40,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 10:08:40,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 10:08:40,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 10:08:40,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 10:08:40,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (1/1) ... [2018-04-11 10:08:40,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 10:08:40,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 10:08:40,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 10:08:40,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 10:08:40,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (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 10:08:40,831 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 10:08:40,831 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 10:08:40,831 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 10:08:40,831 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 10:08:40,832 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-11 10:08:40,832 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 10:08:40,832 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 10:08:40,833 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 10:08:40,834 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 10:08:40,835 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 10:08:40,836 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 10:08:40,837 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 10:08:40,838 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 10:08:40,839 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 10:08:40,840 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 10:08:40,841 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 10:08:40,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 10:08:40,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 10:08:40,843 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 10:08:40,843 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 10:08:41,100 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 10:08:41,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:08:41 BoogieIcfgContainer [2018-04-11 10:08:41,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 10:08:41,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 10:08:41,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 10:08:41,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 10:08:41,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:08:40" (1/3) ... [2018-04-11 10:08:41,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5393393b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:08:41, skipping insertion in model container [2018-04-11 10:08:41,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:08:40" (2/3) ... [2018-04-11 10:08:41,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5393393b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:08:41, skipping insertion in model container [2018-04-11 10:08:41,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:08:41" (3/3) ... [2018-04-11 10:08:41,105 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:08:41,110 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 10:08:41,114 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 10:08:41,143 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 10:08:41,144 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 10:08:41,144 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 10:08:41,144 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 10:08:41,144 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 10:08:41,144 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 10:08:41,144 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 10:08:41,144 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 10:08:41,144 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 10:08:41,145 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 10:08:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-11 10:08:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 10:08:41,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:41,158 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:41,158 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245197, now seen corresponding path program 1 times [2018-04-11 10:08:41,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:41,162 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:41,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:41,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:41,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:41,294 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 10:08:41,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:41,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:08:41,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:08:41,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:08:41,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:08:41,313 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-04-11 10:08:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:41,396 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-11 10:08:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:08:41,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 10:08:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:41,406 INFO L225 Difference]: With dead ends: 55 [2018-04-11 10:08:41,406 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 10:08:41,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:08:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 10:08:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 10:08:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 10:08:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 10:08:41,439 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-04-11 10:08:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:41,439 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 10:08:41,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:08:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 10:08:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 10:08:41,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:41,440 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:41,440 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245198, now seen corresponding path program 1 times [2018-04-11 10:08:41,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:41,441 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:41,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:41,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:41,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:41,543 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 10:08:41,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:41,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:08:41,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:08:41,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:08:41,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:08:41,545 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-04-11 10:08:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:41,623 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-11 10:08:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:08:41,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 10:08:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:41,624 INFO L225 Difference]: With dead ends: 51 [2018-04-11 10:08:41,624 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 10:08:41,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 10:08:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 10:08:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 10:08:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 10:08:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 10:08:41,628 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-11 10:08:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:41,628 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 10:08:41,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:08:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 10:08:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 10:08:41,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:41,628 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:41,629 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash -813071859, now seen corresponding path program 1 times [2018-04-11 10:08:41,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:41,631 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:41,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:41,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:41,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:41,679 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 10:08:41,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:41,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:08:41,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:08:41,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:08:41,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:08:41,682 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-11 10:08:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:41,731 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 10:08:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:08:41,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 10:08:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:41,732 INFO L225 Difference]: With dead ends: 50 [2018-04-11 10:08:41,732 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 10:08:41,733 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 10:08:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 10:08:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 10:08:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 10:08:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 10:08:41,737 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-04-11 10:08:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:41,737 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 10:08:41,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:08:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 10:08:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 10:08:41,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:41,739 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:41,739 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash -813071858, now seen corresponding path program 1 times [2018-04-11 10:08:41,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:41,740 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:41,740 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:41,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:41,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:41,797 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 10:08:41,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:41,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:08:41,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:08:41,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:08:41,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:08:41,798 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-04-11 10:08:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:41,829 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 10:08:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:08:41,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 10:08:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:41,830 INFO L225 Difference]: With dead ends: 49 [2018-04-11 10:08:41,830 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 10:08:41,830 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 10:08:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 10:08:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 10:08:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 10:08:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 10:08:41,834 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-11 10:08:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:41,834 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 10:08:41,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:08:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 10:08:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 10:08:41,838 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:41,838 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 10:08:41,838 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash 198035442, now seen corresponding path program 1 times [2018-04-11 10:08:41,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:41,839 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:41,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:41,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:41,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:41,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:41,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:08:41,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:08:41,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:08:41,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:08:41,893 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-11 10:08:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:41,928 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 10:08:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:08:41,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 10:08:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:41,929 INFO L225 Difference]: With dead ends: 48 [2018-04-11 10:08:41,929 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 10:08:41,929 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 10:08:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 10:08:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 10:08:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 10:08:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-11 10:08:41,932 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-04-11 10:08:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:41,932 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-11 10:08:41,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:08:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-11 10:08:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 10:08:41,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:41,932 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 10:08:41,932 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash 198035443, now seen corresponding path program 1 times [2018-04-11 10:08:41,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:41,932 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:41,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:41,933 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:41,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,011 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 10:08:42,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:08:42,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:08:42,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:08:42,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:08:42,013 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-04-11 10:08:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,137 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-04-11 10:08:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 10:08:42,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 10:08:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,140 INFO L225 Difference]: With dead ends: 72 [2018-04-11 10:08:42,141 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 10:08:42,141 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 10:08:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 10:08:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-04-11 10:08:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 10:08:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 10:08:42,145 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-04-11 10:08:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,145 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 10:08:42,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:08:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 10:08:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 10:08:42,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,146 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] [2018-04-11 10:08:42,146 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194078, now seen corresponding path program 1 times [2018-04-11 10:08:42,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,146 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,194 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 10:08:42,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:08:42,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:08:42,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:08:42,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:08:42,196 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-11 10:08:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,241 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-11 10:08:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:08:42,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 10:08:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,242 INFO L225 Difference]: With dead ends: 51 [2018-04-11 10:08:42,242 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 10:08:42,242 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 10:08:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 10:08:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-04-11 10:08:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 10:08:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 10:08:42,244 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-04-11 10:08:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,245 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 10:08:42,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:08:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 10:08:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 10:08:42,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,245 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] [2018-04-11 10:08:42,245 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194077, now seen corresponding path program 1 times [2018-04-11 10:08:42,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,245 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,339 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 10:08:42,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:08:42,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:08:42,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:08:42,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:08:42,340 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-11 10:08:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,433 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-04-11 10:08:42,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 10:08:42,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 10:08:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,436 INFO L225 Difference]: With dead ends: 66 [2018-04-11 10:08:42,436 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 10:08:42,436 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 10:08:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 10:08:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-11 10:08:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 10:08:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-04-11 10:08:42,439 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-04-11 10:08:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,440 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-04-11 10:08:42,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:08:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-04-11 10:08:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:08:42,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,440 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:42,441 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411736, now seen corresponding path program 1 times [2018-04-11 10:08:42,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,441 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,480 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 10:08:42,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:08:42,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:08:42,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:08:42,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:08:42,481 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-04-11 10:08:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,545 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-04-11 10:08:42,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:08:42,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 10:08:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,546 INFO L225 Difference]: With dead ends: 59 [2018-04-11 10:08:42,546 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 10:08:42,547 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 10:08:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 10:08:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-11 10:08:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 10:08:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-11 10:08:42,550 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-04-11 10:08:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,550 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-11 10:08:42,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:08:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-11 10:08:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:08:42,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,551 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:42,551 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411735, now seen corresponding path program 1 times [2018-04-11 10:08:42,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,551 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,627 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 10:08:42,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:08:42,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:08:42,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:08:42,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:08:42,628 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-04-11 10:08:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,713 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-04-11 10:08:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:08:42,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-11 10:08:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,715 INFO L225 Difference]: With dead ends: 92 [2018-04-11 10:08:42,715 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 10:08:42,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:08:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 10:08:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-04-11 10:08:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 10:08:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-04-11 10:08:42,719 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-04-11 10:08:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,720 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-04-11 10:08:42,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:08:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-04-11 10:08:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 10:08:42,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,721 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] [2018-04-11 10:08:42,721 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1307124962, now seen corresponding path program 1 times [2018-04-11 10:08:42,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,721 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,741 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 10:08:42,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:08:42,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:08:42,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:08:42,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:08:42,742 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-04-11 10:08:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,747 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-04-11 10:08:42,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:08:42,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-11 10:08:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,748 INFO L225 Difference]: With dead ends: 64 [2018-04-11 10:08:42,748 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 10:08:42,748 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 10:08:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 10:08:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-11 10:08:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 10:08:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-04-11 10:08:42,750 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-04-11 10:08:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,751 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-04-11 10:08:42,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:08:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-04-11 10:08:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:08:42,751 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,751 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 10:08:42,751 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2015624486, now seen corresponding path program 1 times [2018-04-11 10:08:42,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,751 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,788 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 10:08:42,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:08:42,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:08:42,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:08:42,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:08:42,789 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-04-11 10:08:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:42,847 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-04-11 10:08:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:08:42,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 10:08:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:42,848 INFO L225 Difference]: With dead ends: 70 [2018-04-11 10:08:42,848 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 10:08:42,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:08:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 10:08:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-11 10:08:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 10:08:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-11 10:08:42,852 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-11 10:08:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:42,852 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-11 10:08:42,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:08:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-11 10:08:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:08:42,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:42,853 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 10:08:42,853 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1801524697, now seen corresponding path program 1 times [2018-04-11 10:08:42,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:42,853 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:42,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:42,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:42,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:42,959 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 10:08:42,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:42,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:08:42,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:08:42,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:08:42,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:08:42,964 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-04-11 10:08:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:43,089 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-04-11 10:08:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 10:08:43,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-11 10:08:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:43,091 INFO L225 Difference]: With dead ends: 66 [2018-04-11 10:08:43,091 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 10:08:43,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:08:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 10:08:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 10:08:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 10:08:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-11 10:08:43,094 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-04-11 10:08:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:43,095 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-11 10:08:43,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:08:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-11 10:08:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:08:43,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:43,096 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] [2018-04-11 10:08:43,096 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:43,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1695652845, now seen corresponding path program 1 times [2018-04-11 10:08:43,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:43,096 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:43,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:43,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:43,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:43,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:43,366 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 10:08:43,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:43,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 10:08:43,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 10:08:43,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 10:08:43,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:08:43,367 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 17 states. [2018-04-11 10:08:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:43,636 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-04-11 10:08:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 10:08:43,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-11 10:08:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:43,637 INFO L225 Difference]: With dead ends: 109 [2018-04-11 10:08:43,637 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 10:08:43,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2018-04-11 10:08:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 10:08:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2018-04-11 10:08:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 10:08:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-04-11 10:08:43,639 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 29 [2018-04-11 10:08:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:43,639 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-04-11 10:08:43,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 10:08:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-04-11 10:08:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:08:43,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:43,640 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] [2018-04-11 10:08:43,640 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 793876117, now seen corresponding path program 1 times [2018-04-11 10:08:43,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:43,640 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:43,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:43,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:43,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:43,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:43,735 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 10:08:43,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:43,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 10:08:43,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:08:43,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:08:43,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:08:43,736 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 11 states. [2018-04-11 10:08:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:43,851 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-04-11 10:08:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 10:08:43,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-11 10:08:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:43,852 INFO L225 Difference]: With dead ends: 104 [2018-04-11 10:08:43,852 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 10:08:43,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:08:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 10:08:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-11 10:08:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 10:08:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-11 10:08:43,854 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 29 [2018-04-11 10:08:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:43,854 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-11 10:08:43,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:08:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-11 10:08:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:08:43,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:43,855 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] [2018-04-11 10:08:43,855 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1012730835, now seen corresponding path program 1 times [2018-04-11 10:08:43,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:43,856 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:43,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:43,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:43,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:43,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:44,018 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 10:08:44,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:08:44,018 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:08:44,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:44,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:08:44,136 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 10:08:44,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:44,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:44,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:44,148 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 10:08:44,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-11 10:08:44,260 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 10:08:44,265 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 14 treesize of output 11 [2018-04-11 10:08:44,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:44,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:08:44,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:08:44,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-04-11 10:08:44,353 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 10:08:44,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:08:44,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-04-11 10:08:44,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 10:08:44,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 10:08:44,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-04-11 10:08:44,372 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 20 states. [2018-04-11 10:08:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:45,488 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-04-11 10:08:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 10:08:45,488 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-04-11 10:08:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:45,489 INFO L225 Difference]: With dead ends: 97 [2018-04-11 10:08:45,489 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 10:08:45,489 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-04-11 10:08:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 10:08:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2018-04-11 10:08:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 10:08:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-04-11 10:08:45,491 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 29 [2018-04-11 10:08:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:45,491 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-04-11 10:08:45,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 10:08:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-04-11 10:08:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 10:08:45,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:45,492 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 10:08:45,492 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1864805931, now seen corresponding path program 1 times [2018-04-11 10:08:45,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:45,492 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:45,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:45,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:45,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:45,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:45,627 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 10:08:45,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:08:45,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 10:08:45,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:08:45,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:08:45,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:08:45,628 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 11 states. [2018-04-11 10:08:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:45,705 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-04-11 10:08:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 10:08:45,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-11 10:08:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:45,706 INFO L225 Difference]: With dead ends: 74 [2018-04-11 10:08:45,706 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 10:08:45,706 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:08:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 10:08:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-04-11 10:08:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 10:08:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-11 10:08:45,708 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 31 [2018-04-11 10:08:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:45,708 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-11 10:08:45,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:08:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-11 10:08:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 10:08:45,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:45,709 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 10:08:45,709 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1724257321, now seen corresponding path program 1 times [2018-04-11 10:08:45,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:45,710 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:45,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:45,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:45,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:45,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:45,858 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 10:08:45,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:08:45,858 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:08:45,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:45,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:08:45,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:45,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 10:08:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:45,913 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 10:08:45,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 10:08:45,939 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 10:08:45,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:45,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,946 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 10:08:45,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 10:08:45,966 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 10:08:45,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:45,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:45,977 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 10:08:45,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 10:08:46,052 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 10:08:46,060 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 14 treesize of output 11 [2018-04-11 10:08:46,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:46,066 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 10:08:46,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:46,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:08:46,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:08:46,078 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-04-11 10:08:46,121 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 10:08:46,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:08:46,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-04-11 10:08:46,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 10:08:46,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 10:08:46,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-04-11 10:08:46,141 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 23 states. [2018-04-11 10:08:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:46,711 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-04-11 10:08:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 10:08:46,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-04-11 10:08:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:46,712 INFO L225 Difference]: With dead ends: 125 [2018-04-11 10:08:46,712 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 10:08:46,713 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 10:08:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 10:08:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-04-11 10:08:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 10:08:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-04-11 10:08:46,715 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 31 [2018-04-11 10:08:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:46,716 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-04-11 10:08:46,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 10:08:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-04-11 10:08:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:08:46,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:46,716 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 10:08:46,716 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:46,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036441, now seen corresponding path program 1 times [2018-04-11 10:08:46,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:46,717 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:46,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:46,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:46,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:46,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:46,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:08:46,984 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:08:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:47,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:08:47,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:47,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 10:08:47,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:47,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:47,061 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 10:08:47,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 10:08:47,102 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 10:08:47,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:47,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,109 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 10:08:47,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 10:08:47,138 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 10:08:47,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:47,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:47,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 10:08:47,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 10:08:48,038 WARN L148 SmtUtils]: Spent 664ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 10:08:48,129 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 43 treesize of output 53 [2018-04-11 10:08:48,156 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 41 treesize of output 47 [2018-04-11 10:08:48,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 10:08:48,211 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 41 treesize of output 33 [2018-04-11 10:08:48,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,264 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 33 treesize of output 49 [2018-04-11 10:08:48,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-11 10:08:48,329 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 33 treesize of output 31 [2018-04-11 10:08:48,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:48,397 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 27 treesize of output 20 [2018-04-11 10:08:48,397 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,398 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 10:08:48,399 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,456 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 31 treesize of output 23 [2018-04-11 10:08:48,457 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,458 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 35 treesize of output 27 [2018-04-11 10:08:48,458 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,460 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 34 treesize of output 26 [2018-04-11 10:08:48,460 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,513 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 37 treesize of output 29 [2018-04-11 10:08:48,513 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:48,564 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 29 treesize of output 27 [2018-04-11 10:08:48,565 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:48,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 10:08:48,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:08:48,652 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-04-11 10:08:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:48,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:08:48,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-04-11 10:08:48,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 10:08:48,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 10:08:48,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 10:08:48,756 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 33 states. [2018-04-11 10:08:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:50,258 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 10:08:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:08:50,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-04-11 10:08:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:50,259 INFO L225 Difference]: With dead ends: 100 [2018-04-11 10:08:50,259 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 10:08:50,260 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=335, Invalid=2215, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 10:08:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 10:08:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-04-11 10:08:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 10:08:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-11 10:08:50,262 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2018-04-11 10:08:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:50,262 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-11 10:08:50,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 10:08:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-11 10:08:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 10:08:50,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:50,263 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:50,263 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2127994563, now seen corresponding path program 2 times [2018-04-11 10:08:50,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:50,263 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:50,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:50,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:50,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:50,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:08:50,467 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:08:50,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:08:50,496 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:08:50,496 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:08:50,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:08:50,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:50,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:50,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:50,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 10:08:50,566 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 10:08:50,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 10:08:50,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:50,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:50,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:50,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 10:08:50,713 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 20 treesize of output 16 [2018-04-11 10:08:50,719 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 10:08:50,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:50,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:08:50,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:08:50,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-04-11 10:08:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:50,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:08:50,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-11 10:08:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 10:08:50,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 10:08:50,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:08:50,842 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 22 states. [2018-04-11 10:08:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:51,543 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-04-11 10:08:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 10:08:51,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-11 10:08:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:51,543 INFO L225 Difference]: With dead ends: 102 [2018-04-11 10:08:51,543 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 10:08:51,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 10:08:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 10:08:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2018-04-11 10:08:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 10:08:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-11 10:08:51,545 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 37 [2018-04-11 10:08:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:51,546 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-11 10:08:51,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 10:08:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-11 10:08:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:08:51,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:51,546 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:51,546 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1372787131, now seen corresponding path program 1 times [2018-04-11 10:08:51,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:51,546 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:51,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:51,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:08:51,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:51,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:51,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:08:51,613 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:08:51,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:51,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:08:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:51,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:08:51,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-04-11 10:08:51,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:08:51,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:08:51,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:08:51,667 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-04-11 10:08:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:08:51,731 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-11 10:08:51,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:08:51,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-11 10:08:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:08:51,731 INFO L225 Difference]: With dead ends: 75 [2018-04-11 10:08:51,731 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 10:08:51,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-04-11 10:08:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 10:08:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-04-11 10:08:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 10:08:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-11 10:08:51,733 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 38 [2018-04-11 10:08:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:08:51,733 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-11 10:08:51,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:08:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-11 10:08:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 10:08:51,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:08:51,733 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:08:51,733 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:08:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash -518903735, now seen corresponding path program 2 times [2018-04-11 10:08:51,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:08:51,734 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:08:51,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:51,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:08:51,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:08:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:08:51,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:08:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:52,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:08:52,170 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:08:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:08:52,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:08:52,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:08:52,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:08:52,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:52,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 10:08:52,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:52,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:52,246 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 10:08:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 10:08:52,286 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 10:08:52,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:52,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,296 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 10:08:52,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 10:08:52,677 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 10:08:52,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:08:52,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:08:52,689 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 10:08:52,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-04-11 10:08:53,721 WARN L148 SmtUtils]: Spent 745ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 10:08:53,828 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 53 treesize of output 61 [2018-04-11 10:08:53,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:53,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-11 10:08:53,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:53,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:53,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 72 [2018-04-11 10:08:53,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 10:08:53,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:08:53,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-11 10:08:53,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:08:54,044 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 40 treesize of output 32 [2018-04-11 10:08:54,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-11 10:08:54,047 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,117 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 40 treesize of output 32 [2018-04-11 10:08:54,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,119 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 36 [2018-04-11 10:08:54,119 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,184 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 36 treesize of output 29 [2018-04-11 10:08:54,184 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,185 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 32 treesize of output 25 [2018-04-11 10:08:54,185 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,244 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 40 treesize of output 32 [2018-04-11 10:08:54,245 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,246 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 43 treesize of output 35 [2018-04-11 10:08:54,246 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,248 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 36 [2018-04-11 10:08:54,248 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:08:54,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 10:08:54,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:08:54,377 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:72, output treesize:81 [2018-04-11 10:08:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:08:54,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:08:54,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2018-04-11 10:08:54,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 10:08:54,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 10:08:54,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1177, Unknown=1, NotChecked=0, Total=1260 [2018-04-11 10:08:54,510 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 36 states. [2018-04-11 10:08:55,242 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 60 DAG size of output 54 [2018-04-11 10:08:55,704 WARN L151 SmtUtils]: Spent 430ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-04-11 10:08:58,124 WARN L151 SmtUtils]: Spent 2382ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-04-11 10:09:00,521 WARN L151 SmtUtils]: Spent 2266ms on a formula simplification. DAG size of input: 90 DAG size of output 72 [2018-04-11 10:09:06,757 WARN L151 SmtUtils]: Spent 4081ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-04-11 10:09:09,092 WARN L151 SmtUtils]: Spent 2283ms on a formula simplification. DAG size of input: 108 DAG size of output 85 [2018-04-11 10:09:11,657 WARN L151 SmtUtils]: Spent 2508ms on a formula simplification. DAG size of input: 108 DAG size of output 82 [2018-04-11 10:09:17,309 WARN L151 SmtUtils]: Spent 5596ms on a formula simplification. DAG size of input: 115 DAG size of output 86 [2018-04-11 10:09:26,235 WARN L151 SmtUtils]: Spent 8852ms on a formula simplification. DAG size of input: 126 DAG size of output 93 [2018-04-11 10:09:26,455 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 127 DAG size of output 94 [2018-04-11 10:09:29,322 WARN L151 SmtUtils]: Spent 468ms on a formula simplification. DAG size of input: 99 DAG size of output 78 [2018-04-11 10:09:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:09:33,146 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-04-11 10:09:33,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 10:09:33,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-04-11 10:09:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:09:33,148 INFO L225 Difference]: With dead ends: 92 [2018-04-11 10:09:33,148 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 10:09:33,148 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=368, Invalid=2934, Unknown=4, NotChecked=0, Total=3306 [2018-04-11 10:09:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 10:09:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-04-11 10:09:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 10:09:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-11 10:09:33,150 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 41 [2018-04-11 10:09:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:09:33,151 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-11 10:09:33,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 10:09:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-11 10:09:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 10:09:33,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:09:33,151 INFO L355 BasicCegarLoop]: trace histogram [3, 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 10:09:33,151 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:09:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1224572237, now seen corresponding path program 2 times [2018-04-11 10:09:33,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:09:33,152 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:09:33,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:09:33,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:09:33,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:09:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:09:33,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:09:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:09:33,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:09:33,378 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:09:33,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:09:33,401 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:09:33,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:09:33,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:09:33,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 6 treesize of output 5 [2018-04-11 10:09:33,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:09:33,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 10:09:33,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:09:33,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:09:33,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:09:33,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,449 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 10:09:33,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 10:09:33,486 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 10:09:33,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:09:33,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-11 10:09:33,519 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 10:09:33,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:09:33,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,531 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 10:09:33,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-11 10:09:33,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 10:09:33,687 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 10:09:33,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:09:33,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 10:09:33,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:33,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:09:33,705 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 10:09:33,705 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-04-11 10:09:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:09:33,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:09:33,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-04-11 10:09:33,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 10:09:33,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 10:09:33,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:09:33,782 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 24 states. [2018-04-11 10:09:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:09:36,140 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-04-11 10:09:36,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:09:36,140 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-04-11 10:09:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:09:36,141 INFO L225 Difference]: With dead ends: 100 [2018-04-11 10:09:36,141 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 10:09:36,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 10:09:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 10:09:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 55. [2018-04-11 10:09:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 10:09:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-11 10:09:36,143 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 44 [2018-04-11 10:09:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:09:36,143 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-11 10:09:36,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 10:09:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-11 10:09:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 10:09:36,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:09:36,143 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:09:36,143 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:09:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash 981065013, now seen corresponding path program 1 times [2018-04-11 10:09:36,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:09:36,143 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:09:36,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:09:36,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:09:36,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:09:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:09:36,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:09:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:09:36,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:09:36,615 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:09:36,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:09:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:09:36,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:09:36,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:09:36,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:09:36,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 10:09:36,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:09:36,685 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 10:09:36,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:09:36,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:09:36,692 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 10:09:36,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 10:09:36,736 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 10:09:36,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:09:36,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,760 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 10:09:36,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 10:09:36,795 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 10:09:36,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:09:36,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:09:36,806 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 10:09:36,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 10:09:39,228 WARN L148 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 10:09:39,334 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 47 treesize of output 57 [2018-04-11 10:09:39,336 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 49 treesize of output 42 [2018-04-11 10:09:39,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:39,367 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 10:09:39,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:39,394 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 41 treesize of output 31 [2018-04-11 10:09:39,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:39,424 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 41 treesize of output 33 [2018-04-11 10:09:39,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:09:39,461 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 33 treesize of output 31 [2018-04-11 10:09:39,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 10:09:39,503 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 37 treesize of output 57 [2018-04-11 10:09:39,503 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-11 10:09:39,555 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 31 treesize of output 39 [2018-04-11 10:09:39,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 10:09:39,599 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 28 treesize of output 26 [2018-04-11 10:09:39,600 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 10:09:39,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 10:09:39,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:09:39,678 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2018-04-11 10:09:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:09:39,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:09:39,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2018-04-11 10:09:39,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 10:09:39,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 10:09:39,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1297, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 10:09:39,808 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 38 states. [2018-04-11 10:09:42,586 WARN L151 SmtUtils]: Spent 2106ms on a formula simplification. DAG size of input: 76 DAG size of output 59 [2018-04-11 10:09:44,815 WARN L151 SmtUtils]: Spent 2185ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-04-11 10:09:47,398 WARN L151 SmtUtils]: Spent 2535ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-04-11 10:09:47,643 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 89 DAG size of output 69 [2018-04-11 10:09:48,166 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 110 DAG size of output 80 [2018-04-11 10:09:48,420 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 110 DAG size of output 81 [2018-04-11 10:09:50,626 WARN L151 SmtUtils]: Spent 2071ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-04-11 10:09:52,784 WARN L151 SmtUtils]: Spent 2090ms on a formula simplification. DAG size of input: 77 DAG size of output 59 [2018-04-11 10:09:57,645 WARN L151 SmtUtils]: Spent 2079ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 10:10:03,829 WARN L151 SmtUtils]: Spent 6137ms on a formula simplification. DAG size of input: 90 DAG size of output 76 [2018-04-11 10:10:08,964 WARN L151 SmtUtils]: Spent 2864ms on a formula simplification. DAG size of input: 90 DAG size of output 69 [2018-04-11 10:10:09,394 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 68 DAG size of output 54 [2018-04-11 10:10:09,865 WARN L151 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 94 DAG size of output 73 [2018-04-11 10:10:12,583 WARN L151 SmtUtils]: Spent 2615ms on a formula simplification. DAG size of input: 111 DAG size of output 79 [2018-04-11 10:10:12,994 WARN L151 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 74 DAG size of output 60 [2018-04-11 10:10:15,424 WARN L151 SmtUtils]: Spent 2325ms on a formula simplification. DAG size of input: 111 DAG size of output 80 [2018-04-11 10:10:16,259 WARN L151 SmtUtils]: Spent 603ms on a formula simplification. DAG size of input: 81 DAG size of output 67 [2018-04-11 10:10:17,198 WARN L151 SmtUtils]: Spent 630ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 10:10:17,901 WARN L151 SmtUtils]: Spent 515ms on a formula simplification. DAG size of input: 81 DAG size of output 64 [2018-04-11 10:10:18,455 WARN L151 SmtUtils]: Spent 311ms on a formula simplification. DAG size of input: 85 DAG size of output 68 [2018-04-11 10:10:19,621 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 74 DAG size of output 59 [2018-04-11 10:10:20,440 WARN L151 SmtUtils]: Spent 460ms on a formula simplification. DAG size of input: 103 DAG size of output 76 [2018-04-11 10:10:21,161 WARN L151 SmtUtils]: Spent 444ms on a formula simplification. DAG size of input: 103 DAG size of output 77 [2018-04-11 10:10:21,762 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 76 DAG size of output 61 [2018-04-11 10:10:22,963 WARN L151 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 70 DAG size of output 55 [2018-04-11 10:10:23,622 WARN L151 SmtUtils]: Spent 360ms on a formula simplification. DAG size of input: 76 DAG size of output 61 [2018-04-11 10:10:24,184 WARN L151 SmtUtils]: Spent 409ms on a formula simplification. DAG size of input: 83 DAG size of output 68 [2018-04-11 10:10:24,650 WARN L151 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 10:10:25,319 WARN L151 SmtUtils]: Spent 562ms on a formula simplification. DAG size of input: 87 DAG size of output 69 [2018-04-11 10:10:26,189 WARN L151 SmtUtils]: Spent 662ms on a formula simplification. DAG size of input: 104 DAG size of output 75 [2018-04-11 10:10:27,938 WARN L151 SmtUtils]: Spent 1623ms on a formula simplification. DAG size of input: 104 DAG size of output 76 [2018-04-11 10:10:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:10:27,945 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-04-11 10:10:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 10:10:27,945 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2018-04-11 10:10:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:10:27,946 INFO L225 Difference]: With dead ends: 101 [2018-04-11 10:10:27,946 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 10:10:27,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=1139, Invalid=5341, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 10:10:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 10:10:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 10:10:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 10:10:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-04-11 10:10:27,948 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-04-11 10:10:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:10:27,948 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-04-11 10:10:27,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 10:10:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-04-11 10:10:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 10:10:27,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:10:27,949 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:10:27,949 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 10:10:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1969827015, now seen corresponding path program 3 times [2018-04-11 10:10:27,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:10:27,949 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:10:27,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:10:27,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:10:27,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:10:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:10:27,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:10:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 10:10:28,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:10:28,217 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:10:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 10:10:28,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 10:10:28,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:10:28,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:10:28,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:10:28,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:10:28,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 10:10:28,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:10:28,289 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 10:10:28,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:10:28,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:10:28,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 11 treesize of output 4 [2018-04-11 10:10:28,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 10:10:28,343 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 10:10:28,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 10:10:28,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,351 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 10:10:28,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 10:10:28,378 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 10:10:28,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:10:28,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:10:28,388 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 10:10:28,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 10:10:31,225 WARN L148 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 10:10:31,514 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 47 treesize of output 57 [2018-04-11 10:10:31,520 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 45 treesize of output 43 [2018-04-11 10:10:31,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:10:31,559 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 35 treesize of output 27 [2018-04-11 10:10:31,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:31,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-11 10:10:31,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:31,592 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 45 treesize of output 38 [2018-04-11 10:10:31,592 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:31,625 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 10:10:31,625 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:31,657 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 28 treesize of output 26 [2018-04-11 10:10:31,657 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 10:10:31,688 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 41 treesize of output 31 [2018-04-11 10:10:31,688 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:10:31,732 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 31 treesize of output 39 [2018-04-11 10:10:31,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 10:10:31,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 10:10:31,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:10:31,843 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2018-04-11 10:10:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 10:10:31,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:10:31,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-11 10:10:31,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 10:10:31,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 10:10:31,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 10:10:31,935 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 33 states. [2018-04-11 10:10:32,391 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 39 DAG size of output 35 [2018-04-11 10:10:32,764 WARN L151 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 51 DAG size of output 43 [2018-04-11 10:10:33,006 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-11 10:10:33,664 WARN L151 SmtUtils]: Spent 586ms on a formula simplification. DAG size of input: 64 DAG size of output 56 [2018-04-11 10:10:34,610 WARN L151 SmtUtils]: Spent 881ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-04-11 10:10:34,967 WARN L151 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 68 DAG size of output 56 [2018-04-11 10:10:35,385 WARN L151 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 89 DAG size of output 68 [2018-04-11 10:10:36,718 WARN L151 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-04-11 10:10:37,133 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-04-11 10:10:37,374 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 62 DAG size of output 54 [2018-04-11 10:10:37,768 WARN L151 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-11 10:10:38,120 WARN L151 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-04-11 10:10:38,738 WARN L151 SmtUtils]: Spent 540ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-04-11 10:10:39,400 WARN L151 SmtUtils]: Spent 606ms on a formula simplification. DAG size of input: 90 DAG size of output 68 [2018-04-11 10:10:39,948 WARN L151 SmtUtils]: Spent 462ms on a formula simplification. DAG size of input: 90 DAG size of output 71 [2018-04-11 10:10:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:10:39,981 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-04-11 10:10:39,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 10:10:39,981 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-11 10:10:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:10:39,982 INFO L225 Difference]: With dead ends: 49 [2018-04-11 10:10:39,982 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 10:10:39,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=445, Invalid=2311, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 10:10:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 10:10:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 10:10:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 10:10:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 10:10:39,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-04-11 10:10:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:10:39,983 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 10:10:39,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 10:10:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 10:10:39,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 10:10:39,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:10:39 BoogieIcfgContainer [2018-04-11 10:10:39,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 10:10:39,986 INFO L168 Benchmark]: Toolchain (without parser) took 119576.41 ms. Allocated memory was 402.7 MB in the beginning and 976.2 MB in the end (delta: 573.6 MB). Free memory was 337.9 MB in the beginning and 428.1 MB in the end (delta: -90.3 MB). Peak memory consumption was 483.3 MB. Max. memory is 5.3 GB. [2018-04-11 10:10:39,987 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 402.7 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:10:39,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.71 ms. Allocated memory is still 402.7 MB. Free memory was 336.5 MB in the beginning and 312.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 10:10:39,987 INFO L168 Benchmark]: Boogie Preprocessor took 42.96 ms. Allocated memory is still 402.7 MB. Free memory was 312.7 MB in the beginning and 311.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 10:10:39,987 INFO L168 Benchmark]: RCFGBuilder took 376.72 ms. Allocated memory was 402.7 MB in the beginning and 615.5 MB in the end (delta: 212.9 MB). Free memory was 310.1 MB in the beginning and 548.7 MB in the end (delta: -238.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-11 10:10:39,987 INFO L168 Benchmark]: TraceAbstraction took 118884.42 ms. Allocated memory was 615.5 MB in the beginning and 976.2 MB in the end (delta: 360.7 MB). Free memory was 548.7 MB in the beginning and 428.1 MB in the end (delta: 120.6 MB). Peak memory consumption was 481.3 MB. Max. memory is 5.3 GB. [2018-04-11 10:10:39,988 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 402.7 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 266.71 ms. Allocated memory is still 402.7 MB. Free memory was 336.5 MB in the beginning and 312.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.96 ms. Allocated memory is still 402.7 MB. Free memory was 312.7 MB in the beginning and 311.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 376.72 ms. Allocated memory was 402.7 MB in the beginning and 615.5 MB in the end (delta: 212.9 MB). Free memory was 310.1 MB in the beginning and 548.7 MB in the end (delta: -238.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 118884.42 ms. Allocated memory was 615.5 MB in the beginning and 976.2 MB in the end (delta: 360.7 MB). Free memory was 548.7 MB in the beginning and 428.1 MB in the end (delta: 120.6 MB). Peak memory consumption was 481.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 15 error locations. SAFE Result, 118.8s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 102.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 857 SDtfs, 2560 SDslu, 4129 SDs, 0 SdLazy, 5549 SolverSat, 448 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 515 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3574 ImplicationChecksByTransitivity, 106.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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, 25 MinimizatonAttempts, 288 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1015 ConstructedInterpolants, 128 QuantifiedInterpolants, 489220 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1579 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 48/276 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/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_10-10-39-992.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_10-10-39-992.csv Received shutdown request...