java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:48:11,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:48:11,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:48:11,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:48:11,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:48:11,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:48:11,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:48:11,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:48:11,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:48:11,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:48:11,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:48:11,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:48:11,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:48:11,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:48:11,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:48:11,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:48:11,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:48:11,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:48:11,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:48:11,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:48:11,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:48:11,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:48:11,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:48:11,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:48:11,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:48:11,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:48:11,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:48:11,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:48:11,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:48:11,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:48:11,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:48:11,314 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:48:11,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:48:11,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:48:11,336 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:48:11,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:48:11,336 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:48:11,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:48:11,337 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:48:11,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:48:11,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:48:11,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:48:11,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:48:11,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:48:11,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:48:11,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:48:11,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:48:11,339 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:48:11,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:48:11,339 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:48:11,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:48:11,379 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:48:11,382 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:48:11,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:48:11,387 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:48:11,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,755 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG801bef233 [2018-04-11 15:48:11,876 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:48:11,877 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:48:11,877 INFO L168 CDTParser]: Scanning tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,882 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:48:11,883 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:48:11,883 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:48:11,883 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,883 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:48:11,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ushort in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____useconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__wchar_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____swblk_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__register_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uint in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__size_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____intptr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____socklen_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____qaddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__lldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__div_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_set in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ulong in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:11,924 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG801bef233 [2018-04-11 15:48:11,927 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:48:11,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:48:11,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:48:11,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:48:11,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:48:11,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:48:11" (1/1) ... [2018-04-11 15:48:11,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec29464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:11, skipping insertion in model container [2018-04-11 15:48:11,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:48:11" (1/1) ... [2018-04-11 15:48:11,953 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:48:11,977 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:48:12,126 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:48:12,161 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:48:12,168 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 15:48:12,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12 WrapperNode [2018-04-11 15:48:12,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:48:12,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:48:12,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:48:12,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:48:12,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... [2018-04-11 15:48:12,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:48:12,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:48:12,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:48:12,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:48:12,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:48:12,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:48:12,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:48:12,337 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:48:12,337 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:48:12,337 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:48:12,337 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:48:12,337 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:48:12,337 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:48:12,337 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:48:12,338 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:48:12,339 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:48:12,340 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:48:12,341 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:48:12,342 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:48:12,343 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:48:12,344 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:48:12,345 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:48:12,346 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:48:12,347 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:48:12,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:48:12,766 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:48:12,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:48:12 BoogieIcfgContainer [2018-04-11 15:48:12,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:48:12,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:48:12,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:48:12,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:48:12,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:48:11" (1/3) ... [2018-04-11 15:48:12,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61211545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:48:12, skipping insertion in model container [2018-04-11 15:48:12,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:48:12" (2/3) ... [2018-04-11 15:48:12,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61211545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:48:12, skipping insertion in model container [2018-04-11 15:48:12,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:48:12" (3/3) ... [2018-04-11 15:48:12,772 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 15:48:12,778 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:48:12,783 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-11 15:48:12,807 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:48:12,807 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:48:12,808 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:48:12,808 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:48:12,808 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:48:12,808 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:48:12,808 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:48:12,808 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:48:12,808 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:48:12,808 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:48:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2018-04-11 15:48:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 15:48:12,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:12,826 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:12,826 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 534396452, now seen corresponding path program 1 times [2018-04-11 15:48:12,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:12,830 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:12,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:12,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:12,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:12,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:12,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:12,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:12,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:48:12,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:48:12,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:48:12,936 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2018-04-11 15:48:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,106 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2018-04-11 15:48:13,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:48:13,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 15:48:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,117 INFO L225 Difference]: With dead ends: 180 [2018-04-11 15:48:13,117 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 15:48:13,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 15:48:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2018-04-11 15:48:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:48:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-04-11 15:48:13,157 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 8 [2018-04-11 15:48:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,158 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-04-11 15:48:13,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:48:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-04-11 15:48:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 15:48:13,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,158 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:13,158 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash 534396453, now seen corresponding path program 1 times [2018-04-11 15:48:13,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:13,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:48:13,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:48:13,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:48:13,218 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 4 states. [2018-04-11 15:48:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,335 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-04-11 15:48:13,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:48:13,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 15:48:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,341 INFO L225 Difference]: With dead ends: 169 [2018-04-11 15:48:13,341 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 15:48:13,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 15:48:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2018-04-11 15:48:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:48:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-04-11 15:48:13,349 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-04-11 15:48:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,349 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-04-11 15:48:13,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:48:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-04-11 15:48:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:48:13,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,350 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:13,350 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612785, now seen corresponding path program 1 times [2018-04-11 15:48:13,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,350 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:13,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:48:13,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:48:13,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:48:13,385 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-04-11 15:48:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,507 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-04-11 15:48:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:48:13,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:48:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,508 INFO L225 Difference]: With dead ends: 158 [2018-04-11 15:48:13,508 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 15:48:13,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 15:48:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2018-04-11 15:48:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:48:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-04-11 15:48:13,514 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-04-11 15:48:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,514 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-04-11 15:48:13,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:48:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-04-11 15:48:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:48:13,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,514 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:13,514 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612786, now seen corresponding path program 1 times [2018-04-11 15:48:13,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,515 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:48:13,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:48:13,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:48:13,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:13,564 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 5 states. [2018-04-11 15:48:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,752 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2018-04-11 15:48:13,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:48:13,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:48:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,753 INFO L225 Difference]: With dead ends: 241 [2018-04-11 15:48:13,754 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 15:48:13,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 15:48:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 186. [2018-04-11 15:48:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 15:48:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 244 transitions. [2018-04-11 15:48:13,761 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 244 transitions. Word has length 14 [2018-04-11 15:48:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,762 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 244 transitions. [2018-04-11 15:48:13,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:48:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 244 transitions. [2018-04-11 15:48:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:48:13,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,762 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:13,762 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash -655644961, now seen corresponding path program 1 times [2018-04-11 15:48:13,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:48:13,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:48:13,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:48:13,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:48:13,792 INFO L87 Difference]: Start difference. First operand 186 states and 244 transitions. Second operand 4 states. [2018-04-11 15:48:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,802 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-04-11 15:48:13,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:48:13,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 15:48:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,804 INFO L225 Difference]: With dead ends: 199 [2018-04-11 15:48:13,804 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 15:48:13,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 15:48:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2018-04-11 15:48:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 15:48:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2018-04-11 15:48:13,812 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 17 [2018-04-11 15:48:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,812 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2018-04-11 15:48:13,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:48:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2018-04-11 15:48:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:48:13,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,814 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] [2018-04-11 15:48:13,815 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1393122237, now seen corresponding path program 1 times [2018-04-11 15:48:13,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,815 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:13,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:48:13,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:48:13,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:13,849 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 3 states. [2018-04-11 15:48:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,854 INFO L93 Difference]: Finished difference Result 189 states and 245 transitions. [2018-04-11 15:48:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:48:13,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-11 15:48:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,855 INFO L225 Difference]: With dead ends: 189 [2018-04-11 15:48:13,855 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 15:48:13,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 15:48:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-11 15:48:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 15:48:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2018-04-11 15:48:13,860 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 22 [2018-04-11 15:48:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,861 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2018-04-11 15:48:13,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:48:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2018-04-11 15:48:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:48:13,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,861 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] [2018-04-11 15:48:13,862 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,862 INFO L82 PathProgramCache]: Analyzing trace with hash 145884264, now seen corresponding path program 1 times [2018-04-11 15:48:13,862 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,862 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:13,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:48:13,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:48:13,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:13,887 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 3 states. [2018-04-11 15:48:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,893 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2018-04-11 15:48:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:48:13,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-11 15:48:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,895 INFO L225 Difference]: With dead ends: 191 [2018-04-11 15:48:13,895 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 15:48:13,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 15:48:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-04-11 15:48:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 15:48:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2018-04-11 15:48:13,901 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 22 [2018-04-11 15:48:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,902 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2018-04-11 15:48:13,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:48:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2018-04-11 15:48:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:48:13,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,903 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] [2018-04-11 15:48:13,903 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1289236446, now seen corresponding path program 1 times [2018-04-11 15:48:13,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:13,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:13,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:13,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:48:13,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:48:13,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:13,946 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2018-04-11 15:48:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:13,959 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2018-04-11 15:48:13,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:48:13,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-11 15:48:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:13,960 INFO L225 Difference]: With dead ends: 207 [2018-04-11 15:48:13,961 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 15:48:13,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 15:48:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-11 15:48:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 15:48:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2018-04-11 15:48:13,964 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 24 [2018-04-11 15:48:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:13,965 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2018-04-11 15:48:13,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:48:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-04-11 15:48:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:48:13,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:13,965 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] [2018-04-11 15:48:13,965 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash 527848965, now seen corresponding path program 1 times [2018-04-11 15:48:13,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:13,966 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:13,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:13,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:13,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:13,983 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:13,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:13,983 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:13,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:14,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:14,055 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 13 treesize of output 10 [2018-04-11 15:48:14,057 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 10 treesize of output 9 [2018-04-11 15:48:14,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,067 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 13 treesize of output 10 [2018-04-11 15:48:14,069 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 10 treesize of output 9 [2018-04-11 15:48:14,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-11 15:48:14,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:48:14,106 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 15 treesize of output 3 [2018-04-11 15:48:14,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:48:14,113 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 15 treesize of output 3 [2018-04-11 15:48:14,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:14,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-11 15:48:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:14,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:14,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:48:14,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:48:14,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:48:14,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:48:14,131 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 6 states. [2018-04-11 15:48:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:14,366 INFO L93 Difference]: Finished difference Result 307 states and 378 transitions. [2018-04-11 15:48:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:48:14,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 15:48:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:14,368 INFO L225 Difference]: With dead ends: 307 [2018-04-11 15:48:14,368 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 15:48:14,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:48:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 15:48:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2018-04-11 15:48:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 15:48:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2018-04-11 15:48:14,375 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 24 [2018-04-11 15:48:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:14,375 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2018-04-11 15:48:14,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:48:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2018-04-11 15:48:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:48:14,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:14,376 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:14,376 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221121, now seen corresponding path program 1 times [2018-04-11 15:48:14,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:14,377 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:14,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:14,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:14,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:14,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:14,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:14,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:48:14,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:48:14,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:48:14,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:14,418 INFO L87 Difference]: Start difference. First operand 212 states and 271 transitions. Second operand 5 states. [2018-04-11 15:48:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:14,589 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2018-04-11 15:48:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:48:14,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 15:48:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:14,590 INFO L225 Difference]: With dead ends: 339 [2018-04-11 15:48:14,591 INFO L226 Difference]: Without dead ends: 339 [2018-04-11 15:48:14,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-11 15:48:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 211. [2018-04-11 15:48:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-11 15:48:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2018-04-11 15:48:14,595 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 25 [2018-04-11 15:48:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:14,596 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2018-04-11 15:48:14,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:48:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2018-04-11 15:48:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:48:14,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:14,597 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:14,597 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221120, now seen corresponding path program 1 times [2018-04-11 15:48:14,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:14,597 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:14,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:14,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:14,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:14,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:14,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:48:14,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:48:14,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:48:14,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:14,650 INFO L87 Difference]: Start difference. First operand 211 states and 269 transitions. Second operand 5 states. [2018-04-11 15:48:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:14,838 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2018-04-11 15:48:14,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:48:14,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 15:48:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:14,840 INFO L225 Difference]: With dead ends: 374 [2018-04-11 15:48:14,840 INFO L226 Difference]: Without dead ends: 374 [2018-04-11 15:48:14,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-11 15:48:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 210. [2018-04-11 15:48:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 15:48:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2018-04-11 15:48:14,844 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 25 [2018-04-11 15:48:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:14,844 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2018-04-11 15:48:14,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:48:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2018-04-11 15:48:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:48:14,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:14,845 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 15:48:14,845 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1869347276, now seen corresponding path program 1 times [2018-04-11 15:48:14,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:14,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:14,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:14,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:14,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:14,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:14,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:14,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:48:14,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:48:14,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:48:14,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:48:14,899 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand 6 states. [2018-04-11 15:48:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:14,997 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2018-04-11 15:48:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:48:14,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 15:48:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:14,998 INFO L225 Difference]: With dead ends: 223 [2018-04-11 15:48:14,998 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 15:48:14,998 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 15:48:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 15:48:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2018-04-11 15:48:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 15:48:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2018-04-11 15:48:15,001 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 26 [2018-04-11 15:48:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:15,001 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2018-04-11 15:48:15,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:48:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2018-04-11 15:48:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:48:15,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:15,002 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 15:48:15,002 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1875072914, now seen corresponding path program 1 times [2018-04-11 15:48:15,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:15,003 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:15,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:15,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:15,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:15,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:15,011 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:15,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:15,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:15,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:15,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:15,052 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 11 treesize of output 8 [2018-04-11 15:48:15,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:48:15,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,065 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 11 treesize of output 8 [2018-04-11 15:48:15,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:48:15,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 15:48:15,082 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 21 treesize of output 16 [2018-04-11 15:48:15,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:15,085 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 16 treesize of output 23 [2018-04-11 15:48:15,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,098 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 21 treesize of output 16 [2018-04-11 15:48:15,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:15,100 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 16 treesize of output 23 [2018-04-11 15:48:15,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 15:48:15,146 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 24 treesize of output 18 [2018-04-11 15:48:15,148 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:48:15,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:15,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-11 15:48:15,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,160 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 24 treesize of output 18 [2018-04-11 15:48:15,162 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:48:15,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:15,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-11 15:48:15,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-11 15:48:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:15,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:15,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:48:15,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:48:15,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:48:15,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:48:15,186 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand 9 states. [2018-04-11 15:48:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:15,606 INFO L93 Difference]: Finished difference Result 291 states and 359 transitions. [2018-04-11 15:48:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:48:15,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 15:48:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:15,607 INFO L225 Difference]: With dead ends: 291 [2018-04-11 15:48:15,607 INFO L226 Difference]: Without dead ends: 291 [2018-04-11 15:48:15,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:48:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-11 15:48:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 258. [2018-04-11 15:48:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-11 15:48:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2018-04-11 15:48:15,613 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 26 [2018-04-11 15:48:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:15,613 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2018-04-11 15:48:15,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:48:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2018-04-11 15:48:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:48:15,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:15,614 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:15,614 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash 121654351, now seen corresponding path program 1 times [2018-04-11 15:48:15,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:15,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:15,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:15,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:15,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:15,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:15,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:15,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:48:15,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:48:15,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:48:15,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:48:15,715 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand 6 states. [2018-04-11 15:48:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:15,911 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2018-04-11 15:48:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:48:15,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 15:48:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:15,912 INFO L225 Difference]: With dead ends: 261 [2018-04-11 15:48:15,912 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 15:48:15,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:48:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 15:48:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 226. [2018-04-11 15:48:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-11 15:48:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2018-04-11 15:48:15,918 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 28 [2018-04-11 15:48:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:15,918 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2018-04-11 15:48:15,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:48:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2018-04-11 15:48:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:48:15,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:15,919 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:15,919 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 398243291, now seen corresponding path program 1 times [2018-04-11 15:48:15,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:15,920 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:15,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:15,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:15,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:15,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:15,932 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:15,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:15,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:15,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:15,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:15,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:15,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:48:15,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:48:15,985 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 11 treesize of output 8 [2018-04-11 15:48:15,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:48:15,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:15,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:48:16,013 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 15:48:16,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:48:16,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:16,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 15:48:16,041 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 36 treesize of output 24 [2018-04-11 15:48:16,043 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 19 treesize of output 10 [2018-04-11 15:48:16,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:48:16,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:16,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 15:48:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:16,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:16,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:48:16,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:48:16,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:48:16,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:16,070 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 8 states. [2018-04-11 15:48:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:16,344 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2018-04-11 15:48:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:48:16,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:48:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:16,345 INFO L225 Difference]: With dead ends: 263 [2018-04-11 15:48:16,345 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 15:48:16,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:48:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 15:48:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2018-04-11 15:48:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 15:48:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 283 transitions. [2018-04-11 15:48:16,348 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 283 transitions. Word has length 28 [2018-04-11 15:48:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:16,348 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 283 transitions. [2018-04-11 15:48:16,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:48:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 283 transitions. [2018-04-11 15:48:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:48:16,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:16,349 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:16,349 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash 398243292, now seen corresponding path program 1 times [2018-04-11 15:48:16,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:16,349 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:16,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:16,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:16,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:16,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:16,359 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:16,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:16,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:16,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:16,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:16,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:48:16,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:16,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:16,405 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:48:16,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:48:16,423 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 11 treesize of output 8 [2018-04-11 15:48:16,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:48:16,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,434 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 11 treesize of output 8 [2018-04-11 15:48:16,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:48:16,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 15:48:16,465 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-11 15:48:16,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:48:16,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,496 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 27 treesize of output 28 [2018-04-11 15:48:16,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:48:16,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:16,509 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-11 15:48:16,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-11 15:48:16,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:48:16,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-11 15:48:16,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,568 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 22 treesize of output 20 [2018-04-11 15:48:16,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:48:16,571 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,579 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 11 treesize of output 3 [2018-04-11 15:48:16,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:16,584 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-11 15:48:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:16,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:16,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:48:16,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:48:16,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:48:16,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:16,593 INFO L87 Difference]: Start difference. First operand 225 states and 283 transitions. Second operand 8 states. [2018-04-11 15:48:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:16,901 INFO L93 Difference]: Finished difference Result 262 states and 327 transitions. [2018-04-11 15:48:16,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:48:16,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:48:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:16,902 INFO L225 Difference]: With dead ends: 262 [2018-04-11 15:48:16,902 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 15:48:16,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:48:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 15:48:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 224. [2018-04-11 15:48:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 15:48:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2018-04-11 15:48:16,904 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 28 [2018-04-11 15:48:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:16,904 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2018-04-11 15:48:16,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:48:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2018-04-11 15:48:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:48:16,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:16,905 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:16,905 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash -468463012, now seen corresponding path program 1 times [2018-04-11 15:48:16,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:16,905 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:16,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:16,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:16,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:16,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:16,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:16,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:48:16,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:48:16,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:48:16,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:16,939 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand 5 states. [2018-04-11 15:48:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:17,151 INFO L93 Difference]: Finished difference Result 353 states and 434 transitions. [2018-04-11 15:48:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:48:17,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 15:48:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:17,153 INFO L225 Difference]: With dead ends: 353 [2018-04-11 15:48:17,154 INFO L226 Difference]: Without dead ends: 353 [2018-04-11 15:48:17,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-11 15:48:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 223. [2018-04-11 15:48:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 15:48:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2018-04-11 15:48:17,158 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 29 [2018-04-11 15:48:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:17,158 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2018-04-11 15:48:17,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:48:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2018-04-11 15:48:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:48:17,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:17,159 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:17,159 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash -468463011, now seen corresponding path program 1 times [2018-04-11 15:48:17,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:17,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:17,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:17,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:17,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:17,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:17,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:48:17,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:48:17,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:48:17,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:48:17,207 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand 5 states. [2018-04-11 15:48:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:17,506 INFO L93 Difference]: Finished difference Result 390 states and 494 transitions. [2018-04-11 15:48:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:48:17,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 15:48:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:17,507 INFO L225 Difference]: With dead ends: 390 [2018-04-11 15:48:17,507 INFO L226 Difference]: Without dead ends: 390 [2018-04-11 15:48:17,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-11 15:48:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 222. [2018-04-11 15:48:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 15:48:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2018-04-11 15:48:17,512 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 29 [2018-04-11 15:48:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:17,512 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2018-04-11 15:48:17,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:48:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2018-04-11 15:48:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:48:17,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:17,513 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:17,513 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2092835834, now seen corresponding path program 1 times [2018-04-11 15:48:17,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:17,513 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:17,514 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:17,514 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:17,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:17,521 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:17,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:17,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:17,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:17,564 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~0.base Int)) (and (= (store |c_old(#valid)| main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0))) is different from true [2018-04-11 15:48:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 15:48:17,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:48:17,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 15:48:17,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:48:17,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:48:17,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-04-11 15:48:17,569 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 7 states. [2018-04-11 15:48:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:17,819 INFO L93 Difference]: Finished difference Result 281 states and 348 transitions. [2018-04-11 15:48:17,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:48:17,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 15:48:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:17,820 INFO L225 Difference]: With dead ends: 281 [2018-04-11 15:48:17,820 INFO L226 Difference]: Without dead ends: 279 [2018-04-11 15:48:17,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=63, Unknown=2, NotChecked=16, Total=110 [2018-04-11 15:48:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-11 15:48:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2018-04-11 15:48:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-11 15:48:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 283 transitions. [2018-04-11 15:48:17,825 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 283 transitions. Word has length 30 [2018-04-11 15:48:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:17,825 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 283 transitions. [2018-04-11 15:48:17,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:48:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 283 transitions. [2018-04-11 15:48:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:48:17,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:17,826 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:17,826 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2092836151, now seen corresponding path program 1 times [2018-04-11 15:48:17,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:17,826 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:17,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:17,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:17,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:17,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:17,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:48:17,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:48:17,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:48:17,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:17,845 INFO L87 Difference]: Start difference. First operand 228 states and 283 transitions. Second operand 3 states. [2018-04-11 15:48:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:17,852 INFO L93 Difference]: Finished difference Result 200 states and 229 transitions. [2018-04-11 15:48:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:48:17,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-11 15:48:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:17,853 INFO L225 Difference]: With dead ends: 200 [2018-04-11 15:48:17,853 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 15:48:17,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:48:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 15:48:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-04-11 15:48:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 15:48:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-04-11 15:48:17,856 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2018-04-11 15:48:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:17,857 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-04-11 15:48:17,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:48:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-04-11 15:48:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:48:17,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:17,857 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:17,857 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757376, now seen corresponding path program 1 times [2018-04-11 15:48:17,858 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:17,858 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:17,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:17,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:17,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:17,869 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:17,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:17,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:17,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:17,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:17,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:17,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:17,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:48:17,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 15:48:17,917 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 13 treesize of output 10 [2018-04-11 15:48:17,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:48:17,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-11 15:48:17,951 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 15:48:17,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:48:17,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:17,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 15:48:17,985 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 44 treesize of output 30 [2018-04-11 15:48:17,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:48:17,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,994 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 25 treesize of output 10 [2018-04-11 15:48:17,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:17,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:18,002 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-11 15:48:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:18,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:18,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:48:18,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:48:18,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:48:18,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:18,013 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 8 states. [2018-04-11 15:48:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:18,274 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2018-04-11 15:48:18,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:48:18,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-11 15:48:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:18,275 INFO L225 Difference]: With dead ends: 189 [2018-04-11 15:48:18,275 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 15:48:18,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:48:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 15:48:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-04-11 15:48:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 15:48:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 212 transitions. [2018-04-11 15:48:18,278 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 212 transitions. Word has length 32 [2018-04-11 15:48:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:18,278 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 212 transitions. [2018-04-11 15:48:18,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:48:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 212 transitions. [2018-04-11 15:48:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:48:18,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:18,279 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:18,279 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757375, now seen corresponding path program 1 times [2018-04-11 15:48:18,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:18,279 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:18,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:18,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:18,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:18,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:18,290 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:18,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:18,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:18,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:18,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:48:18,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:18,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:18,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:48:18,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:48:18,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 13 treesize of output 10 [2018-04-11 15:48:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:48:18,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,356 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 13 treesize of output 10 [2018-04-11 15:48:18,358 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 10 treesize of output 9 [2018-04-11 15:48:18,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-11 15:48:18,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:48:18,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,412 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 15:48:18,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:48:18,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,439 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 42 treesize of output 43 [2018-04-11 15:48:18,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:48:18,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:18,459 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:69 [2018-04-11 15:48:18,487 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 57 treesize of output 41 [2018-04-11 15:48:18,505 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 17 [2018-04-11 15:48:18,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:48:18,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-11 15:48:18,529 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 22 treesize of output 7 [2018-04-11 15:48:18,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:48:18,544 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:18,553 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-11 15:48:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:18,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:48:18,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:48:18,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:48:18,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:48:18,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:48:18,563 INFO L87 Difference]: Start difference. First operand 182 states and 212 transitions. Second operand 8 states. [2018-04-11 15:48:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:18,827 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2018-04-11 15:48:18,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:48:18,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-11 15:48:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:18,828 INFO L225 Difference]: With dead ends: 188 [2018-04-11 15:48:18,828 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 15:48:18,828 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:48:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 15:48:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-04-11 15:48:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 15:48:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2018-04-11 15:48:18,831 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 32 [2018-04-11 15:48:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:18,832 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2018-04-11 15:48:18,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:48:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2018-04-11 15:48:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:48:18,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:18,832 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:18,833 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1370981878, now seen corresponding path program 1 times [2018-04-11 15:48:18,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:18,833 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:18,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:18,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:18,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:19,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:19,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:19,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:19,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:19,138 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 15 treesize of output 11 [2018-04-11 15:48:19,140 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 11 treesize of output 3 [2018-04-11 15:48:19,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,147 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 15 treesize of output 11 [2018-04-11 15:48:19,149 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 11 treesize of output 3 [2018-04-11 15:48:19,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-04-11 15:48:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:19,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:48:19,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-04-11 15:48:19,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:48:19,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:48:19,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:48:19,175 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 14 states. [2018-04-11 15:48:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:48:19,682 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2018-04-11 15:48:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:48:19,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-11 15:48:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:48:19,683 INFO L225 Difference]: With dead ends: 297 [2018-04-11 15:48:19,683 INFO L226 Difference]: Without dead ends: 297 [2018-04-11 15:48:19,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:48:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-11 15:48:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 207. [2018-04-11 15:48:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-11 15:48:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-04-11 15:48:19,686 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 48 [2018-04-11 15:48:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:48:19,686 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-04-11 15:48:19,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:48:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-04-11 15:48:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:48:19,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:48:19,686 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:48:19,686 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:48:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039926, now seen corresponding path program 1 times [2018-04-11 15:48:19,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:48:19,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:48:19,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:19,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:48:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:19,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:48:19,698 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:48:19,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:48:19,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:48:19,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:48:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:48:19,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:48:19,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:19,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:19,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:48:19,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 15:48:19,746 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 13 treesize of output 10 [2018-04-11 15:48:19,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:48:19,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2018-04-11 15:48:19,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:48:19,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-11 15:48:19,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:48:19,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:19,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-04-11 15:48:19,863 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 15:48:19,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:48:19,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:19,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:19,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-11 15:48:25,915 WARN L151 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 27 DAG size of output 23 [2018-04-11 15:48:27,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-11 15:48:27,951 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 7 treesize of output 1 [2018-04-11 15:48:27,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:27,955 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 25 treesize of output 10 [2018-04-11 15:48:27,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:48:27,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:48:27,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:48:27,961 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 15:48:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:48:27,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:48:27,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:48:27,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:48:27,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:48:27,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=3, NotChecked=0, Total=156 [2018-04-11 15:48:27,991 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 13 states. [2018-04-11 15:48:50,231 WARN L151 SmtUtils]: Spent 461ms on a formula simplification. DAG size of input: 60 DAG size of output 37 [2018-04-11 15:49:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:49:08,877 INFO L93 Difference]: Finished difference Result 567 states and 674 transitions. [2018-04-11 15:49:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:49:08,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-04-11 15:49:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:49:08,880 INFO L225 Difference]: With dead ends: 567 [2018-04-11 15:49:08,880 INFO L226 Difference]: Without dead ends: 567 [2018-04-11 15:49:08,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=180, Invalid=401, Unknown=19, NotChecked=0, Total=600 [2018-04-11 15:49:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-04-11 15:49:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 255. [2018-04-11 15:49:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-11 15:49:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-04-11 15:49:08,885 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 48 [2018-04-11 15:49:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:49:08,886 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-04-11 15:49:08,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:49:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-04-11 15:49:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:49:08,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:49:08,886 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:49:08,886 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:49:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039925, now seen corresponding path program 1 times [2018-04-11 15:49:08,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:49:08,887 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:49:08,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:08,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:08,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:08,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:49:08,906 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:49:08,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:49:08,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:49:08,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:08,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:49:08,951 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 11 treesize of output 8 [2018-04-11 15:49:08,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:49:08,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:08,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:08,962 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 11 treesize of output 8 [2018-04-11 15:49:08,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:49:08,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:08,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:08,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:08,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 15:49:08,996 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 21 treesize of output 16 [2018-04-11 15:49:09,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,001 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 16 treesize of output 23 [2018-04-11 15:49:09,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,026 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 21 treesize of output 16 [2018-04-11 15:49:09,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,031 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 16 treesize of output 23 [2018-04-11 15:49:09,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 15:49:09,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:49:09,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:69 [2018-04-11 15:49:09,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 15:49:09,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,246 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 37 treesize of output 31 [2018-04-11 15:49:09,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 59 [2018-04-11 15:49:09,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:49:09,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:49:09,353 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 30 treesize of output 26 [2018-04-11 15:49:09,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:49:09,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:49:09,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:49:09,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:49:09,426 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:100, output treesize:256 [2018-04-11 15:49:09,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-04-11 15:49:09,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:49:09,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2018-04-11 15:49:09,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:49:09,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:09,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2018-04-11 15:49:09,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:49:09,780 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 110 [2018-04-11 15:49:09,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:49:09,860 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,878 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:09,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:49:09,921 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:234, output treesize:194 [2018-04-11 15:49:10,108 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 142 [2018-04-11 15:49:10,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:49:10,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,199 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2018-04-11 15:49:10,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:49:10,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,263 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 146 treesize of output 129 [2018-04-11 15:49:10,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:49:10,267 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,327 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 118 treesize of output 101 [2018-04-11 15:49:10,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:49:10,330 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,343 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 15:49:10,379 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:285, output treesize:245 [2018-04-11 15:49:10,526 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 89 [2018-04-11 15:49:10,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:10,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-04-11 15:49:10,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:49:10,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:49:10,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:49:10,603 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 132 [2018-04-11 15:49:10,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 15:49:10,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:10,635 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2018-04-11 15:49:10,635 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:49:10,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:49:10,760 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 59 treesize of output 49 [2018-04-11 15:49:10,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:49:10,762 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:10,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-04-11 15:49:10,773 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,832 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 95 treesize of output 79 [2018-04-11 15:49:10,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 15:49:10,846 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,868 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:10,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-11 15:49:10,869 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,883 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,886 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 87 treesize of output 71 [2018-04-11 15:49:10,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 15:49:10,889 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:10,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:10,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-11 15:49:10,910 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,919 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:10,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:49:10,944 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:255, output treesize:21 [2018-04-11 15:49:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:49:10,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:49:10,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:49:10,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:49:10,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:49:10,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=265, Unknown=3, NotChecked=0, Total=342 [2018-04-11 15:49:10,983 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 19 states. [2018-04-11 15:49:11,804 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 78 DAG size of output 77 [2018-04-11 15:49:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:49:12,949 INFO L93 Difference]: Finished difference Result 449 states and 538 transitions. [2018-04-11 15:49:12,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:49:12,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-04-11 15:49:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:49:12,951 INFO L225 Difference]: With dead ends: 449 [2018-04-11 15:49:12,951 INFO L226 Difference]: Without dead ends: 449 [2018-04-11 15:49:12,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=339, Invalid=1368, Unknown=15, NotChecked=0, Total=1722 [2018-04-11 15:49:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-11 15:49:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 313. [2018-04-11 15:49:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-11 15:49:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2018-04-11 15:49:12,956 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 48 [2018-04-11 15:49:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:49:12,956 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2018-04-11 15:49:12,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:49:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2018-04-11 15:49:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:49:12,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:49:12,957 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:49:12,957 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:49:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash -136940696, now seen corresponding path program 1 times [2018-04-11 15:49:12,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:49:12,957 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:49:12,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:12,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:12,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:49:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:49:13,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:49:13,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:49:13,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:49:13,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:49:13,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:49:13,020 INFO L87 Difference]: Start difference. First operand 313 states and 383 transitions. Second operand 7 states. [2018-04-11 15:49:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:49:13,159 INFO L93 Difference]: Finished difference Result 403 states and 486 transitions. [2018-04-11 15:49:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:49:13,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-11 15:49:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:49:13,160 INFO L225 Difference]: With dead ends: 403 [2018-04-11 15:49:13,160 INFO L226 Difference]: Without dead ends: 403 [2018-04-11 15:49:13,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:49:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-11 15:49:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 341. [2018-04-11 15:49:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-11 15:49:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2018-04-11 15:49:13,165 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 50 [2018-04-11 15:49:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:49:13,165 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2018-04-11 15:49:13,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:49:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2018-04-11 15:49:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:49:13,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:49:13,166 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:49:13,166 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:49:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1249262698, now seen corresponding path program 1 times [2018-04-11 15:49:13,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:49:13,167 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:49:13,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:13,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:13,168 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:13,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:49:13,187 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:49:13,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:49:13,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:49:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:13,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:49:13,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:49:13,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:49:13,228 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 11 treesize of output 8 [2018-04-11 15:49:13,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:49:13,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,240 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 11 treesize of output 8 [2018-04-11 15:49:13,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:49:13,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-11 15:49:13,267 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 21 treesize of output 16 [2018-04-11 15:49:13,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,270 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 16 treesize of output 23 [2018-04-11 15:49:13,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,283 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 21 treesize of output 16 [2018-04-11 15:49:13,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,285 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 16 treesize of output 23 [2018-04-11 15:49:13,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 15:49:13,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-04-11 15:49:13,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:49:13,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:45 [2018-04-11 15:49:13,349 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 24 treesize of output 18 [2018-04-11 15:49:13,351 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:13,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-11 15:49:13,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,363 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 24 treesize of output 18 [2018-04-11 15:49:13,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:13,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-11 15:49:13,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:7 [2018-04-11 15:49:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:49:13,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:49:13,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:49:13,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:49:13,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:49:13,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:49:13,386 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand 10 states. [2018-04-11 15:49:13,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:49:13,722 INFO L93 Difference]: Finished difference Result 339 states and 405 transitions. [2018-04-11 15:49:13,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:49:13,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-04-11 15:49:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:49:13,723 INFO L225 Difference]: With dead ends: 339 [2018-04-11 15:49:13,723 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 15:49:13,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:49:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 15:49:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-04-11 15:49:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-04-11 15:49:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 384 transitions. [2018-04-11 15:49:13,726 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 384 transitions. Word has length 50 [2018-04-11 15:49:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:49:13,726 INFO L459 AbstractCegarLoop]: Abstraction has 317 states and 384 transitions. [2018-04-11 15:49:13,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:49:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 384 transitions. [2018-04-11 15:49:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:49:13,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:49:13,727 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:49:13,727 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:49:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412237, now seen corresponding path program 1 times [2018-04-11 15:49:13,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:49:13,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:49:13,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:13,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:13,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:49:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:13,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:49:13,735 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:49:13,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:49:13,735 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:49:13,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:49:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:49:13,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:49:13,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:49:13,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 15:49:13,804 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 11 treesize of output 8 [2018-04-11 15:49:13,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:49:13,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 15:49:13,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:49:13,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-11 15:49:13,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:49:13,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:49:13,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 15:49:13,910 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 15:49:13,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:49:13,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:13,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:49:13,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:56 [2018-04-11 15:49:20,476 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-04-11 15:49:20,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 15:49:20,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:20,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:49:20,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-11 15:49:20,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:49:20,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:49:20,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:49:20,508 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:15 [2018-04-11 15:49:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:49:20,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:49:20,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:49:20,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:49:20,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:49:20,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=181, Unknown=4, NotChecked=0, Total=240 [2018-04-11 15:49:20,557 INFO L87 Difference]: Start difference. First operand 317 states and 384 transitions. Second operand 16 states. [2018-04-11 15:49:56,665 WARN L151 SmtUtils]: Spent 3804ms on a formula simplification. DAG size of input: 63 DAG size of output 44 [2018-04-11 15:50:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:50:27,471 INFO L93 Difference]: Finished difference Result 709 states and 851 transitions. [2018-04-11 15:50:27,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:50:27,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 15:50:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:50:27,472 INFO L225 Difference]: With dead ends: 709 [2018-04-11 15:50:27,473 INFO L226 Difference]: Without dead ends: 709 [2018-04-11 15:50:27,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=310, Invalid=783, Unknown=29, NotChecked=0, Total=1122 [2018-04-11 15:50:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-04-11 15:50:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 410. [2018-04-11 15:50:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-11 15:50:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 509 transitions. [2018-04-11 15:50:27,479 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 509 transitions. Word has length 50 [2018-04-11 15:50:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:50:27,479 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 509 transitions. [2018-04-11 15:50:27,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:50:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 509 transitions. [2018-04-11 15:50:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:50:27,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:50:27,480 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:50:27,480 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:50:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412236, now seen corresponding path program 1 times [2018-04-11 15:50:27,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:50:27,480 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:50:27,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:50:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:50:27,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:50:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:50:27,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:50:27,499 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:50:27,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:50:27,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:50:27,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:50:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:50:27,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:50:27,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:50:27,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:50:27,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:27,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:27,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:50:27,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:50:27,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-11 15:50:27,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 15:50:27,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,623 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 11 treesize of output 8 [2018-04-11 15:50:27,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:50:27,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,636 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 11 treesize of output 8 [2018-04-11 15:50:27,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:50:27,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,648 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:39 [2018-04-11 15:50:27,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:27,676 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 27 treesize of output 28 [2018-04-11 15:50:27,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:50:27,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:27,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-11 15:50:27,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:50:27,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:27,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2018-04-11 15:50:27,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:27,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:50:27,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 54 [2018-04-11 15:50:27,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:50:27,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:27,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:50:27,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-04-11 15:50:27,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:50:27,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:27,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:27,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:87 [2018-04-11 15:50:31,956 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-04-11 15:50:31,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:50:31,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-11 15:50:31,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:31,964 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 7 treesize of output 1 [2018-04-11 15:50:31,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:31,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:31,977 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 24 treesize of output 22 [2018-04-11 15:50:31,978 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 7 treesize of output 1 [2018-04-11 15:50:31,979 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:31,982 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:50:31,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:50:31,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:31,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:31,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:31,990 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:23 [2018-04-11 15:50:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:50:32,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:50:32,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:50:32,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:50:32,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:50:32,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=214, Unknown=2, NotChecked=0, Total=272 [2018-04-11 15:50:32,033 INFO L87 Difference]: Start difference. First operand 410 states and 509 transitions. Second operand 17 states. [2018-04-11 15:50:34,308 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 64 DAG size of output 57 [2018-04-11 15:50:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:50:35,421 INFO L93 Difference]: Finished difference Result 585 states and 693 transitions. [2018-04-11 15:50:35,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:50:35,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-11 15:50:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:50:35,423 INFO L225 Difference]: With dead ends: 585 [2018-04-11 15:50:35,423 INFO L226 Difference]: Without dead ends: 585 [2018-04-11 15:50:35,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=416, Invalid=1222, Unknown=2, NotChecked=0, Total=1640 [2018-04-11 15:50:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-04-11 15:50:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 421. [2018-04-11 15:50:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-11 15:50:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2018-04-11 15:50:35,427 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 50 [2018-04-11 15:50:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:50:35,427 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2018-04-11 15:50:35,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:50:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2018-04-11 15:50:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:50:35,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:50:35,428 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:50:35,428 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:50:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash 721092915, now seen corresponding path program 1 times [2018-04-11 15:50:35,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:50:35,428 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:50:35,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:50:35,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:50:35,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:50:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:50:35,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:50:35,437 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:50:35,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:50:35,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:50:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:50:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:50:35,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:50:35,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:50:35,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:50:35,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-04-11 15:50:35,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-11 15:50:35,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:35,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:35,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:50:35,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2018-04-11 15:50:35,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 15:50:35,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,636 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 21 treesize of output 16 [2018-04-11 15:50:35,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:35,639 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 16 treesize of output 23 [2018-04-11 15:50:35,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,655 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 21 treesize of output 16 [2018-04-11 15:50:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:35,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:50:35,658 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,670 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:72, output treesize:37 [2018-04-11 15:50:35,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:35,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-11 15:50:35,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:50:35,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,761 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 31 treesize of output 32 [2018-04-11 15:50:35,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:50:35,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:35,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-04-11 15:50:35,866 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-04-11 15:50:35,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:50:35,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,917 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 46 treesize of output 39 [2018-04-11 15:50:35,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 15:50:35,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:35,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:90 [2018-04-11 15:50:42,029 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2018-04-11 15:50:42,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 15:50:42,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:42,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:50:42,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:50:42,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-04-11 15:50:42,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:42,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:50:42,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-11 15:50:42,065 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:50:42,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:50:42,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:42,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 15:50:42,070 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:50:42,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:42,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:50:42,076 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:107, output treesize:7 [2018-04-11 15:50:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:50:42,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:50:42,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:50:42,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:50:42,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:50:42,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=260, Unknown=3, NotChecked=0, Total=306 [2018-04-11 15:50:42,105 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand 18 states. [2018-04-11 15:51:12,792 WARN L151 SmtUtils]: Spent 4039ms on a formula simplification. DAG size of input: 93 DAG size of output 60 [2018-04-11 15:51:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:51:43,869 INFO L93 Difference]: Finished difference Result 606 states and 747 transitions. [2018-04-11 15:51:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:51:43,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-04-11 15:51:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:51:43,870 INFO L225 Difference]: With dead ends: 606 [2018-04-11 15:51:43,870 INFO L226 Difference]: Without dead ends: 606 [2018-04-11 15:51:43,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=400, Invalid=1467, Unknown=25, NotChecked=0, Total=1892 [2018-04-11 15:51:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-04-11 15:51:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 453. [2018-04-11 15:51:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-11 15:51:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2018-04-11 15:51:43,877 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 50 [2018-04-11 15:51:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:51:43,877 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2018-04-11 15:51:43,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:51:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2018-04-11 15:51:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:51:43,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:51:43,878 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:51:43,878 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 15:51:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -660150828, now seen corresponding path program 1 times [2018-04-11 15:51:43,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:51:43,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:51:43,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:43,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:43,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:51:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:43,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:51:43,893 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:51:43,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:51:43,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:51:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:51:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:51:43,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:51:43,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:51:43,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:51:43,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 15:51:43,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:43,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:51:43,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:43,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:43,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:51:43,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 15:51:43,995 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 11 treesize of output 8 [2018-04-11 15:51:43,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:51:43,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:43,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:44,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:44,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-04-11 15:51:44,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:51:44,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-11 15:51:44,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:51:44,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:44,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:44,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:51:44,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-11 15:51:44,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:51:44,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-04-11 15:51:44,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 15:51:44,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:51:44,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:51:44,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:51:44,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 Received shutdown request... [2018-04-11 15:51:46,153 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 15:51:46,154 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:51:46,157 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:51:46,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:51:46 BoogieIcfgContainer [2018-04-11 15:51:46,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:51:46,158 INFO L168 Benchmark]: Toolchain (without parser) took 214230.67 ms. Allocated memory was 400.6 MB in the beginning and 749.7 MB in the end (delta: 349.2 MB). Free memory was 334.2 MB in the beginning and 433.2 MB in the end (delta: -99.0 MB). Peak memory consumption was 250.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:51:46,160 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.6 MB. Free memory is still 359.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:51:46,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.10 ms. Allocated memory is still 400.6 MB. Free memory was 332.9 MB in the beginning and 307.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:51:46,160 INFO L168 Benchmark]: Boogie Preprocessor took 48.79 ms. Allocated memory is still 400.6 MB. Free memory was 307.6 MB in the beginning and 305.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:51:46,160 INFO L168 Benchmark]: RCFGBuilder took 516.12 ms. Allocated memory was 400.6 MB in the beginning and 586.7 MB in the end (delta: 186.1 MB). Free memory was 305.0 MB in the beginning and 506.3 MB in the end (delta: -201.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:51:46,161 INFO L168 Benchmark]: TraceAbstraction took 213389.73 ms. Allocated memory was 586.7 MB in the beginning and 749.7 MB in the end (delta: 163.1 MB). Free memory was 506.3 MB in the beginning and 433.2 MB in the end (delta: 73.1 MB). Peak memory consumption was 236.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:51:46,161 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.12 ms. Allocated memory is still 400.6 MB. Free memory is still 359.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 273.10 ms. Allocated memory is still 400.6 MB. Free memory was 332.9 MB in the beginning and 307.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.79 ms. Allocated memory is still 400.6 MB. Free memory was 307.6 MB in the beginning and 305.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 516.12 ms. Allocated memory was 400.6 MB in the beginning and 586.7 MB in the end (delta: 186.1 MB). Free memory was 305.0 MB in the beginning and 506.3 MB in the end (delta: -201.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213389.73 ms. Allocated memory was 586.7 MB in the beginning and 749.7 MB in the end (delta: 163.1 MB). Free memory was 506.3 MB in the beginning and 433.2 MB in the end (delta: 73.1 MB). Peak memory consumption was 236.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 55 error locations. TIMEOUT Result, 213.3s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 179.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3251 SDtfs, 8194 SDslu, 9425 SDs, 0 SdLazy, 9467 SolverSat, 648 SolverUnsat, 75 SolverUnknown, 0 SolverNotchecked, 38.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 433 SyntacticMatches, 7 SemanticMatches, 370 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 166.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 2345 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.3s InterpolantComputationTime, 1459 NumberOfCodeBlocks, 1459 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 932 ConstructedInterpolants, 114 QuantifiedInterpolants, 612240 SizeOfPredicates, 164 NumberOfNonLiveVariables, 2210 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 31 InterpolantComputations, 23 PerfectInterpolantSequences, 72/107 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-51-46-166.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-51-46-166.csv Completed graceful shutdown