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-12 06:26:22,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 06:26:22,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 06:26:22,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 06:26:22,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 06:26:22,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 06:26:22,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 06:26:22,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 06:26:22,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 06:26:22,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 06:26:22,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 06:26:22,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 06:26:22,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 06:26:22,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 06:26:22,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 06:26:22,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 06:26:22,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 06:26:22,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 06:26:22,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 06:26:22,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 06:26:22,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 06:26:22,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 06:26:22,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 06:26:22,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 06:26:22,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 06:26:22,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 06:26:22,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 06:26:22,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 06:26:22,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 06:26:22,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 06:26:22,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 06:26:22,436 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-12 06:26:22,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 06:26:22,457 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 06:26:22,458 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 06:26:22,458 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 06:26:22,458 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 06:26:22,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 06:26:22,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 06:26:22,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 06:26:22,459 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 06:26:22,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 06:26:22,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 06:26:22,460 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 06:26:22,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 06:26:22,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 06:26:22,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 06:26:22,460 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 06:26:22,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 06:26:22,461 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 06:26:22,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 06:26:22,499 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 06:26:22,502 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 06:26:22,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 06:26:22,504 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 06:26:22,505 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-12 06:26:22,836 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG767870810 [2018-04-12 06:26:22,960 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 06:26:22,960 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 06:26:22,961 INFO L168 CDTParser]: Scanning tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 06:26:22,968 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 06:26:22,968 INFO L215 ultiparseSymbolTable]: [2018-04-12 06:26:22,968 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 06:26:22,968 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 06:26:22,968 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,969 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,970 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,971 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,972 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,973 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,974 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,975 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,976 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,977 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,978 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-12 06:26:22,996 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG767870810 [2018-04-12 06:26:22,999 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 06:26:23,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 06:26:23,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 06:26:23,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 06:26:23,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 06:26:23,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:26:22" (1/1) ... [2018-04-12 06:26:23,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164f4537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23, skipping insertion in model container [2018-04-12 06:26:23,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:26:22" (1/1) ... [2018-04-12 06:26:23,023 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:26:23,046 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:26:23,175 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:26:23,207 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:26:23,213 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-12 06:26:23,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23 WrapperNode [2018-04-12 06:26:23,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 06:26:23,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 06:26:23,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 06:26:23,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 06:26:23,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (1/1) ... [2018-04-12 06:26:23,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 06:26:23,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 06:26:23,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 06:26:23,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 06:26:23,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (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-12 06:26:23,376 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 06:26:23,376 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 06:26:23,376 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 06:26:23,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 06:26:23,377 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 06:26:23,377 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 06:26:23,377 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 06:26:23,378 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 06:26:23,379 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 06:26:23,380 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 06:26:23,381 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 06:26:23,382 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 06:26:23,383 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 06:26:23,384 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 06:26:23,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 06:26:23,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 06:26:23,772 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 06:26:23,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:26:23 BoogieIcfgContainer [2018-04-12 06:26:23,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 06:26:23,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 06:26:23,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 06:26:23,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 06:26:23,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:26:22" (1/3) ... [2018-04-12 06:26:23,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce10a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:26:23, skipping insertion in model container [2018-04-12 06:26:23,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:26:23" (2/3) ... [2018-04-12 06:26:23,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce10a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:26:23, skipping insertion in model container [2018-04-12 06:26:23,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:26:23" (3/3) ... [2018-04-12 06:26:23,777 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 06:26:23,782 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 06:26:23,793 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-12 06:26:23,826 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 06:26:23,826 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 06:26:23,826 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 06:26:23,826 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 06:26:23,826 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 06:26:23,826 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 06:26:23,826 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 06:26:23,827 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 06:26:23,827 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 06:26:23,827 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 06:26:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2018-04-12 06:26:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 06:26:23,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:23,849 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:26:23,849 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-12 06:26:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 534396452, now seen corresponding path program 1 times [2018-04-12 06:26:23,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:23,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:23,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:23,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:23,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:23,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:23,967 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-12 06:26:23,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:23,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:23,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:26:23,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:26:23,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:26:23,984 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2018-04-12 06:26:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,186 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2018-04-12 06:26:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:26:24,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 06:26:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,197 INFO L225 Difference]: With dead ends: 180 [2018-04-12 06:26:24,197 INFO L226 Difference]: Without dead ends: 176 [2018-04-12 06:26:24,198 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-12 06:26:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-12 06:26:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2018-04-12 06:26:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-12 06:26:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-04-12 06:26:24,237 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 8 [2018-04-12 06:26:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,237 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-04-12 06:26:24,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:26:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-04-12 06:26:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 06:26:24,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,238 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:26:24,238 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-12 06:26:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash 534396453, now seen corresponding path program 1 times [2018-04-12 06:26:24,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,238 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:24,286 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-12 06:26:24,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:24,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:24,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:26:24,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:26:24,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:26:24,289 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 4 states. [2018-04-12 06:26:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,423 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-04-12 06:26:24,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:26:24,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 06:26:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,425 INFO L225 Difference]: With dead ends: 169 [2018-04-12 06:26:24,426 INFO L226 Difference]: Without dead ends: 169 [2018-04-12 06:26:24,426 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-12 06:26:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-12 06:26:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2018-04-12 06:26:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-12 06:26:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-04-12 06:26:24,434 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-04-12 06:26:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,435 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-04-12 06:26:24,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:26:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-04-12 06:26:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 06:26:24,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,435 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:26:24,435 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-12 06:26:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612785, now seen corresponding path program 1 times [2018-04-12 06:26:24,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,436 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:24,478 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-12 06:26:24,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:24,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:24,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:26:24,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:26:24,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:26:24,480 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-04-12 06:26:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,591 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-04-12 06:26:24,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:26:24,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 06:26:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,592 INFO L225 Difference]: With dead ends: 158 [2018-04-12 06:26:24,593 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 06:26:24,593 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-12 06:26:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 06:26:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2018-04-12 06:26:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-12 06:26:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-04-12 06:26:24,597 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-04-12 06:26:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,597 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-04-12 06:26:24,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:26:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-04-12 06:26:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 06:26:24,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,598 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:26:24,598 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-12 06:26:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612786, now seen corresponding path program 1 times [2018-04-12 06:26:24,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,598 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:24,648 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-12 06:26:24,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:24,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:26:24,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:26:24,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:26:24,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:26:24,649 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 5 states. [2018-04-12 06:26:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,844 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2018-04-12 06:26:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:26:24,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-12 06:26:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,846 INFO L225 Difference]: With dead ends: 241 [2018-04-12 06:26:24,846 INFO L226 Difference]: Without dead ends: 241 [2018-04-12 06:26:24,846 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-12 06:26:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-12 06:26:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 186. [2018-04-12 06:26:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 06:26:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 244 transitions. [2018-04-12 06:26:24,853 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 244 transitions. Word has length 14 [2018-04-12 06:26:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,854 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 244 transitions. [2018-04-12 06:26:24,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:26:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 244 transitions. [2018-04-12 06:26:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 06:26:24,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,854 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:26:24,854 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-12 06:26:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash -655644961, now seen corresponding path program 1 times [2018-04-12 06:26:24,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,855 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:24,888 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-12 06:26:24,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:24,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:26:24,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:26:24,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:26:24,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:26:24,889 INFO L87 Difference]: Start difference. First operand 186 states and 244 transitions. Second operand 4 states. [2018-04-12 06:26:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,900 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-04-12 06:26:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:26:24,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-12 06:26:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,902 INFO L225 Difference]: With dead ends: 199 [2018-04-12 06:26:24,902 INFO L226 Difference]: Without dead ends: 199 [2018-04-12 06:26:24,902 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-12 06:26:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-12 06:26:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2018-04-12 06:26:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 06:26:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2018-04-12 06:26:24,909 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 17 [2018-04-12 06:26:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,909 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2018-04-12 06:26:24,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:26:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2018-04-12 06:26:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 06:26:24,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,910 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-12 06:26:24,910 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-12 06:26:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1393122237, now seen corresponding path program 1 times [2018-04-12 06:26:24,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:24,933 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-12 06:26:24,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:24,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:24,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:26:24,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:26:24,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:26:24,934 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 3 states. [2018-04-12 06:26:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,938 INFO L93 Difference]: Finished difference Result 189 states and 245 transitions. [2018-04-12 06:26:24,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:26:24,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-12 06:26:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,940 INFO L225 Difference]: With dead ends: 189 [2018-04-12 06:26:24,940 INFO L226 Difference]: Without dead ends: 189 [2018-04-12 06:26:24,941 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-12 06:26:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-12 06:26:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-12 06:26:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-12 06:26:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2018-04-12 06:26:24,946 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 22 [2018-04-12 06:26:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,946 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2018-04-12 06:26:24,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:26:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2018-04-12 06:26:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 06:26:24,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,947 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-12 06:26:24,947 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-12 06:26:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash 145884264, now seen corresponding path program 1 times [2018-04-12 06:26:24,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:24,970 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-12 06:26:24,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:24,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:24,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:26:24,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:26:24,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:26:24,971 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 3 states. [2018-04-12 06:26:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:24,976 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2018-04-12 06:26:24,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:26:24,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-12 06:26:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:24,977 INFO L225 Difference]: With dead ends: 191 [2018-04-12 06:26:24,977 INFO L226 Difference]: Without dead ends: 191 [2018-04-12 06:26:24,977 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-12 06:26:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-12 06:26:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-04-12 06:26:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 06:26:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2018-04-12 06:26:24,979 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 22 [2018-04-12 06:26:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:24,980 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2018-04-12 06:26:24,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:26:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2018-04-12 06:26:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 06:26:24,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:24,980 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-12 06:26:24,980 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-12 06:26:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1289236446, now seen corresponding path program 1 times [2018-04-12 06:26:24,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:24,981 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:24,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:24,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:24,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:25,005 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-12 06:26:25,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:25,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:25,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:26:25,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:26:25,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:26:25,006 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2018-04-12 06:26:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:25,015 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2018-04-12 06:26:25,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:26:25,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-12 06:26:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:25,016 INFO L225 Difference]: With dead ends: 207 [2018-04-12 06:26:25,016 INFO L226 Difference]: Without dead ends: 207 [2018-04-12 06:26:25,016 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-12 06:26:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-12 06:26:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-12 06:26:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 06:26:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2018-04-12 06:26:25,020 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 24 [2018-04-12 06:26:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:25,023 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2018-04-12 06:26:25,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:26:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-04-12 06:26:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 06:26:25,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:25,023 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-12 06:26:25,024 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-12 06:26:25,024 INFO L82 PathProgramCache]: Analyzing trace with hash 527848965, now seen corresponding path program 1 times [2018-04-12 06:26:25,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:25,024 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:25,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:25,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:25,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:25,043 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:25,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:25,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:25,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:25,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:25,116 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-12 06:26:25,119 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-12 06:26:25,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,131 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-12 06:26:25,134 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-12 06:26:25,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-12 06:26:25,159 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-12 06:26:25,162 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-12 06:26:25,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,168 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-12 06:26:25,169 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-12 06:26:25,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:25,171 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-12 06:26:25,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-12 06:26:25,180 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-12 06:26:25,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:25,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:26:25,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:26:25,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:26:25,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:26:25,181 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 6 states. [2018-04-12 06:26:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:25,372 INFO L93 Difference]: Finished difference Result 307 states and 378 transitions. [2018-04-12 06:26:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:26:25,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-12 06:26:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:25,373 INFO L225 Difference]: With dead ends: 307 [2018-04-12 06:26:25,373 INFO L226 Difference]: Without dead ends: 307 [2018-04-12 06:26:25,374 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-12 06:26:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-12 06:26:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2018-04-12 06:26:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-12 06:26:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2018-04-12 06:26:25,378 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 24 [2018-04-12 06:26:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:25,379 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2018-04-12 06:26:25,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:26:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2018-04-12 06:26:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 06:26:25,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:25,386 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-12 06:26:25,386 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-12 06:26:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221121, now seen corresponding path program 1 times [2018-04-12 06:26:25,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:25,387 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:25,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:25,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:25,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:25,425 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-12 06:26:25,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:25,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:26:25,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:26:25,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:26:25,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:26:25,426 INFO L87 Difference]: Start difference. First operand 212 states and 271 transitions. Second operand 5 states. [2018-04-12 06:26:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:25,563 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2018-04-12 06:26:25,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:26:25,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 06:26:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:25,564 INFO L225 Difference]: With dead ends: 339 [2018-04-12 06:26:25,564 INFO L226 Difference]: Without dead ends: 339 [2018-04-12 06:26:25,565 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-12 06:26:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-12 06:26:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 211. [2018-04-12 06:26:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-12 06:26:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2018-04-12 06:26:25,568 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 25 [2018-04-12 06:26:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:25,568 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2018-04-12 06:26:25,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:26:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2018-04-12 06:26:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 06:26:25,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:25,571 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-12 06:26:25,571 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-12 06:26:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221120, now seen corresponding path program 1 times [2018-04-12 06:26:25,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:25,571 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:25,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:25,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:25,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:25,624 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-12 06:26:25,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:25,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:26:25,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:26:25,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:26:25,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:26:25,626 INFO L87 Difference]: Start difference. First operand 211 states and 269 transitions. Second operand 5 states. [2018-04-12 06:26:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:25,818 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2018-04-12 06:26:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:26:25,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 06:26:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:25,819 INFO L225 Difference]: With dead ends: 374 [2018-04-12 06:26:25,819 INFO L226 Difference]: Without dead ends: 374 [2018-04-12 06:26:25,819 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-12 06:26:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-12 06:26:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 210. [2018-04-12 06:26:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-12 06:26:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2018-04-12 06:26:25,824 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 25 [2018-04-12 06:26:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:25,825 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2018-04-12 06:26:25,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:26:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2018-04-12 06:26:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 06:26:25,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:25,826 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-12 06:26:25,826 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-12 06:26:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1869347276, now seen corresponding path program 1 times [2018-04-12 06:26:25,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:25,826 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:25,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:25,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:25,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:25,879 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-12 06:26:25,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:25,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:26:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:26:25,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:26:25,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:26:25,880 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand 6 states. [2018-04-12 06:26:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:25,988 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2018-04-12 06:26:25,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 06:26:25,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-12 06:26:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:25,989 INFO L225 Difference]: With dead ends: 223 [2018-04-12 06:26:25,989 INFO L226 Difference]: Without dead ends: 223 [2018-04-12 06:26:25,989 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-12 06:26:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-12 06:26:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2018-04-12 06:26:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-12 06:26:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2018-04-12 06:26:25,992 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 26 [2018-04-12 06:26:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:25,992 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2018-04-12 06:26:25,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:26:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2018-04-12 06:26:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 06:26:25,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:25,993 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-12 06:26:25,993 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-12 06:26:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1875072914, now seen corresponding path program 1 times [2018-04-12 06:26:25,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:25,993 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:25,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:25,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:25,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:26,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:26,005 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:26,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:26,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:26,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:26,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:26,035 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-12 06:26:26,037 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-12 06:26:26,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,047 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-12 06:26:26,049 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-12 06:26:26,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-12 06:26:26,069 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-12 06:26:26,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:26,072 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-12 06:26:26,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,085 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-12 06:26:26,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:26,088 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-12 06:26:26,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-12 06:26:26,136 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-12 06:26:26,138 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:26:26,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:26,139 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-12 06:26:26,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,149 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-12 06:26:26,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:26:26,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:26,152 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-12 06:26:26,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,166 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-12 06:26:26,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-12 06:26:26,181 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-12 06:26:26,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:26,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 06:26:26,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:26:26,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:26:26,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-12 06:26:26,182 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand 9 states. [2018-04-12 06:26:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:26,578 INFO L93 Difference]: Finished difference Result 291 states and 359 transitions. [2018-04-12 06:26:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:26:26,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-12 06:26:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:26,579 INFO L225 Difference]: With dead ends: 291 [2018-04-12 06:26:26,579 INFO L226 Difference]: Without dead ends: 291 [2018-04-12 06:26:26,579 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-12 06:26:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-12 06:26:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 258. [2018-04-12 06:26:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-12 06:26:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2018-04-12 06:26:26,582 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 26 [2018-04-12 06:26:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:26,582 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2018-04-12 06:26:26,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:26:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2018-04-12 06:26:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 06:26:26,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:26,582 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-12 06:26:26,582 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-12 06:26:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash 121654351, now seen corresponding path program 1 times [2018-04-12 06:26:26,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:26,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:26,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:26,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:26,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:26,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:26,641 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-12 06:26:26,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:26,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:26:26,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:26:26,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:26:26,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:26:26,642 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand 6 states. [2018-04-12 06:26:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:26,791 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2018-04-12 06:26:26,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 06:26:26,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 06:26:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:26,792 INFO L225 Difference]: With dead ends: 261 [2018-04-12 06:26:26,792 INFO L226 Difference]: Without dead ends: 261 [2018-04-12 06:26:26,792 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-12 06:26:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-12 06:26:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 226. [2018-04-12 06:26:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-12 06:26:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2018-04-12 06:26:26,795 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 28 [2018-04-12 06:26:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:26,795 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2018-04-12 06:26:26,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:26:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2018-04-12 06:26:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 06:26:26,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:26,795 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-12 06:26:26,796 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-12 06:26:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash 398243291, now seen corresponding path program 1 times [2018-04-12 06:26:26,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:26,796 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:26,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:26,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:26,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:26,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:26,804 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:26,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:26,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:26,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:26,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:26,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:26,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:26,840 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-12 06:26:26,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-12 06:26:26,853 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-12 06:26:26,856 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-12 06:26:26,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,861 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-12 06:26:26,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-12 06:26:26,923 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-12 06:26:26,926 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-12 06:26:26,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,940 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-12 06:26:26,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-12 06:26:26,961 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-12 06:26:26,963 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-12 06:26:26,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,970 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-12 06:26:26,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:26,978 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-12 06:26:26,978 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-12 06:26:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:26:26,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:26,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:26:26,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:26:26,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:26:26,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-12 06:26:26,989 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 8 states. [2018-04-12 06:26:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:27,327 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2018-04-12 06:26:27,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:26:27,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-12 06:26:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:27,329 INFO L225 Difference]: With dead ends: 263 [2018-04-12 06:26:27,329 INFO L226 Difference]: Without dead ends: 263 [2018-04-12 06:26:27,329 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-12 06:26:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-12 06:26:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2018-04-12 06:26:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-12 06:26:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 283 transitions. [2018-04-12 06:26:27,333 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 283 transitions. Word has length 28 [2018-04-12 06:26:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:27,333 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 283 transitions. [2018-04-12 06:26:27,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:26:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 283 transitions. [2018-04-12 06:26:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 06:26:27,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:27,334 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-12 06:26:27,334 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-12 06:26:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash 398243292, now seen corresponding path program 1 times [2018-04-12 06:26:27,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:27,334 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:27,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:27,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:27,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:27,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:27,347 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:27,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:27,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:27,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:27,379 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-12 06:26:27,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:27,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:27,389 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-12 06:26:27,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-12 06:26:27,408 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-12 06:26:27,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:26:27,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,419 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-12 06:26:27,420 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-12 06:26:27,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,426 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-12 06:26:27,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-12 06:26:27,472 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-12 06:26:27,475 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-12 06:26:27,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,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-12 06:26:27,499 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-12 06:26:27,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,512 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-12 06:26:27,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-12 06:26:27,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-12 06:26:27,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-12 06:26:27,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,551 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-12 06:26:27,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,569 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-12 06:26:27,572 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-12 06:26:27,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,578 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-12 06:26:27,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:27,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-12 06:26:27,585 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-12 06:26:27,596 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-12 06:26:27,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:27,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:26:27,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:26:27,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:26:27,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 06:26:27,597 INFO L87 Difference]: Start difference. First operand 225 states and 283 transitions. Second operand 8 states. [2018-04-12 06:26:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:27,878 INFO L93 Difference]: Finished difference Result 262 states and 327 transitions. [2018-04-12 06:26:27,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:26:27,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-12 06:26:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:27,879 INFO L225 Difference]: With dead ends: 262 [2018-04-12 06:26:27,879 INFO L226 Difference]: Without dead ends: 262 [2018-04-12 06:26:27,880 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-12 06:26:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-12 06:26:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 224. [2018-04-12 06:26:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-12 06:26:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2018-04-12 06:26:27,882 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 28 [2018-04-12 06:26:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:27,883 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2018-04-12 06:26:27,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:26:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2018-04-12 06:26:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 06:26:27,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:27,883 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-12 06:26:27,883 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-12 06:26:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -468463012, now seen corresponding path program 1 times [2018-04-12 06:26:27,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:27,884 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:27,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:27,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:27,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:27,907 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-12 06:26:27,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:27,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:26:27,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:26:27,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:26:27,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:26:27,908 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand 5 states. [2018-04-12 06:26:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:28,120 INFO L93 Difference]: Finished difference Result 353 states and 434 transitions. [2018-04-12 06:26:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:26:28,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 06:26:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:28,122 INFO L225 Difference]: With dead ends: 353 [2018-04-12 06:26:28,122 INFO L226 Difference]: Without dead ends: 353 [2018-04-12 06:26:28,122 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-12 06:26:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-12 06:26:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 223. [2018-04-12 06:26:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-12 06:26:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2018-04-12 06:26:28,127 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 29 [2018-04-12 06:26:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:28,127 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2018-04-12 06:26:28,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:26:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2018-04-12 06:26:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 06:26:28,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:28,128 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-12 06:26:28,128 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-12 06:26:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -468463011, now seen corresponding path program 1 times [2018-04-12 06:26:28,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:28,128 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:28,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:28,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:28,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:28,174 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-12 06:26:28,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:28,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:26:28,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:26:28,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:26:28,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:26:28,175 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand 5 states. [2018-04-12 06:26:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:28,382 INFO L93 Difference]: Finished difference Result 390 states and 494 transitions. [2018-04-12 06:26:28,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:26:28,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 06:26:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:28,384 INFO L225 Difference]: With dead ends: 390 [2018-04-12 06:26:28,384 INFO L226 Difference]: Without dead ends: 390 [2018-04-12 06:26:28,384 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-12 06:26:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-12 06:26:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 222. [2018-04-12 06:26:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-12 06:26:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2018-04-12 06:26:28,389 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 29 [2018-04-12 06:26:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:28,390 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2018-04-12 06:26:28,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:26:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2018-04-12 06:26:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 06:26:28,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:28,390 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-12 06:26:28,391 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-12 06:26:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2092835834, now seen corresponding path program 1 times [2018-04-12 06:26:28,391 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:28,391 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:28,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:28,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:28,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:28,402 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:28,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:28,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:28,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:28,464 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-12 06:26:28,469 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-12 06:26:28,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:26:28,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 06:26:28,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 06:26:28,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 06:26:28,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-04-12 06:26:28,470 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 7 states. [2018-04-12 06:26:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:28,693 INFO L93 Difference]: Finished difference Result 281 states and 348 transitions. [2018-04-12 06:26:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 06:26:28,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-12 06:26:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:28,694 INFO L225 Difference]: With dead ends: 281 [2018-04-12 06:26:28,694 INFO L226 Difference]: Without dead ends: 279 [2018-04-12 06:26:28,694 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-12 06:26:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-12 06:26:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2018-04-12 06:26:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-12 06:26:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 283 transitions. [2018-04-12 06:26:28,697 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 283 transitions. Word has length 30 [2018-04-12 06:26:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:28,697 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 283 transitions. [2018-04-12 06:26:28,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 06:26:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 283 transitions. [2018-04-12 06:26:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 06:26:28,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:28,698 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-12 06:26:28,698 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-12 06:26:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2092836151, now seen corresponding path program 1 times [2018-04-12 06:26:28,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:28,698 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:28,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:28,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:28,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:28,715 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-12 06:26:28,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:28,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:26:28,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:26:28,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:26:28,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:26:28,716 INFO L87 Difference]: Start difference. First operand 228 states and 283 transitions. Second operand 3 states. [2018-04-12 06:26:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:28,723 INFO L93 Difference]: Finished difference Result 200 states and 229 transitions. [2018-04-12 06:26:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:26:28,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-12 06:26:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:28,724 INFO L225 Difference]: With dead ends: 200 [2018-04-12 06:26:28,724 INFO L226 Difference]: Without dead ends: 184 [2018-04-12 06:26:28,724 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-12 06:26:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-12 06:26:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-04-12 06:26:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-12 06:26:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-04-12 06:26:28,726 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2018-04-12 06:26:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:28,726 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-04-12 06:26:28,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:26:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-04-12 06:26:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 06:26:28,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:28,727 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-12 06:26:28,727 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-12 06:26:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757376, now seen corresponding path program 1 times [2018-04-12 06:26:28,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:28,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:28,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:28,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:28,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:28,737 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:28,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:28,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:28,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:28,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:28,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:28,766 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-12 06:26:28,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-12 06:26:28,777 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-12 06:26:28,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:26:28,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,785 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-12 06:26:28,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-12 06:26:28,804 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-12 06:26:28,805 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-12 06:26:28,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,815 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-12 06:26:28,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-12 06:26:28,845 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-12 06:26:28,849 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-12 06:26:28,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,856 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-12 06:26:28,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:28,863 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-12 06:26:28,863 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-12 06:26:28,874 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-12 06:26:28,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:28,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:26:28,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:26:28,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:26:28,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-12 06:26:28,875 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 8 states. [2018-04-12 06:26:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:29,129 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2018-04-12 06:26:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:26:29,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-12 06:26:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:29,130 INFO L225 Difference]: With dead ends: 189 [2018-04-12 06:26:29,130 INFO L226 Difference]: Without dead ends: 189 [2018-04-12 06:26:29,130 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-12 06:26:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-12 06:26:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-04-12 06:26:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-12 06:26:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 212 transitions. [2018-04-12 06:26:29,133 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 212 transitions. Word has length 32 [2018-04-12 06:26:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:29,133 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 212 transitions. [2018-04-12 06:26:29,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:26:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 212 transitions. [2018-04-12 06:26:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 06:26:29,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:29,134 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-12 06:26:29,134 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-12 06:26:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757375, now seen corresponding path program 1 times [2018-04-12 06:26:29,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:29,134 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:29,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:29,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:29,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:29,145 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:29,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:29,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:29,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:29,175 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-12 06:26:29,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:29,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:29,185 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-12 06:26:29,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-12 06:26:29,202 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-12 06:26:29,204 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-12 06:26:29,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,216 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-12 06:26:29,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 10 treesize of output 9 [2018-04-12 06:26:29,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,227 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-12 06:26:29,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-12 06:26:29,259 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-12 06:26:29,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,284 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-12 06:26:29,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:26:29,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,306 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-12 06:26:29,308 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-12 06:26:29,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,326 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-12 06:26:29,326 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:69 [2018-04-12 06:26:29,348 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-12 06:26:29,355 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-12 06:26:29,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,360 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-12 06:26:29,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,373 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-12 06:26:29,375 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-12 06:26:29,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,380 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-12 06:26:29,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,388 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-12 06:26:29,388 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-12 06:26:29,395 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-12 06:26:29,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:26:29,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:26:29,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:26:29,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:26:29,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 06:26:29,396 INFO L87 Difference]: Start difference. First operand 182 states and 212 transitions. Second operand 8 states. [2018-04-12 06:26:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:29,636 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2018-04-12 06:26:29,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:26:29,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-12 06:26:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:29,637 INFO L225 Difference]: With dead ends: 188 [2018-04-12 06:26:29,637 INFO L226 Difference]: Without dead ends: 188 [2018-04-12 06:26:29,637 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-12 06:26:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-12 06:26:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-04-12 06:26:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-12 06:26:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2018-04-12 06:26:29,641 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 32 [2018-04-12 06:26:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:29,641 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2018-04-12 06:26:29,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:26:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2018-04-12 06:26:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 06:26:29,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:29,642 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-12 06:26:29,642 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-12 06:26:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1370981878, now seen corresponding path program 1 times [2018-04-12 06:26:29,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:29,642 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:29,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:29,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:29,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:29,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:29,840 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-12 06:26:29,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:29,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:29,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:29,979 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-12 06:26:29,981 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-12 06:26:29,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,989 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-12 06:26:29,990 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-12 06:26:29,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:29,994 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-12 06:26:29,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-04-12 06:26:30,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-12 06:26:30,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:26:30,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-04-12 06:26:30,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 06:26:30,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 06:26:30,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-12 06:26:30,024 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 14 states. [2018-04-12 06:26:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:26:30,633 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2018-04-12 06:26:30,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 06:26:30,633 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-12 06:26:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:26:30,634 INFO L225 Difference]: With dead ends: 297 [2018-04-12 06:26:30,634 INFO L226 Difference]: Without dead ends: 297 [2018-04-12 06:26:30,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-04-12 06:26:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-12 06:26:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 207. [2018-04-12 06:26:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-12 06:26:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-04-12 06:26:30,639 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 48 [2018-04-12 06:26:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:26:30,639 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-04-12 06:26:30,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 06:26:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-04-12 06:26:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 06:26:30,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:26:30,640 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-12 06:26:30,640 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-12 06:26:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039926, now seen corresponding path program 1 times [2018-04-12 06:26:30,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:26:30,640 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:26:30,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:30,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:26:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:30,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:26:30,656 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:26:30,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:26:30,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:26:30,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:26:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:26:30,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:26:30,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:30,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:30,700 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-12 06:26:30,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 06:26:30,722 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-12 06:26:30,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:26:30,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,736 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-12 06:26:30,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2018-04-12 06:26:30,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:26:30,783 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-12 06:26:30,787 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-12 06:26:30,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,803 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-12 06:26:30,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-04-12 06:26:30,845 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-12 06:26:30,848 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-12 06:26:30,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:30,864 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-12 06:26:30,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-12 06:26:36,885 WARN L151 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 27 DAG size of output 23 [2018-04-12 06:26:38,918 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-12 06:26:38,924 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-12 06:26:38,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:38,946 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-12 06:26:38,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:26:38,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:26:38,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-12 06:26:38,961 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-12 06:26:38,988 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-12 06:26:38,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:26:38,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 06:26:38,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 06:26:38,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 06:26:38,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=3, NotChecked=0, Total=156 [2018-04-12 06:26:38,989 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 13 states. [2018-04-12 06:27:00,205 WARN L151 SmtUtils]: Spent 433ms on a formula simplification. DAG size of input: 60 DAG size of output 37 [2018-04-12 06:27:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:27:18,964 INFO L93 Difference]: Finished difference Result 567 states and 674 transitions. [2018-04-12 06:27:18,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 06:27:18,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-04-12 06:27:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:27:18,965 INFO L225 Difference]: With dead ends: 567 [2018-04-12 06:27:18,966 INFO L226 Difference]: Without dead ends: 567 [2018-04-12 06:27:18,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=180, Invalid=401, Unknown=19, NotChecked=0, Total=600 [2018-04-12 06:27:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-04-12 06:27:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 255. [2018-04-12 06:27:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-12 06:27:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-04-12 06:27:18,971 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 48 [2018-04-12 06:27:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:27:18,972 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-04-12 06:27:18,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 06:27:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-04-12 06:27:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 06:27:18,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:27:18,972 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-12 06:27:18,972 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-12 06:27:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039925, now seen corresponding path program 1 times [2018-04-12 06:27:18,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:27:18,973 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:27:18,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:18,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:18,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:27:18,988 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:27:18,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:27:18,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:27:18,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:19,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:27:19,033 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-12 06:27:19,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 8 treesize of output 7 [2018-04-12 06:27:19,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,044 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-12 06:27:19,047 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-12 06:27:19,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-12 06:27:19,066 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-12 06:27:19,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,074 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-12 06:27:19,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,091 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-12 06:27:19,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,095 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-12 06:27:19,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-12 06:27:19,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,224 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-12 06:27:19,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:69 [2018-04-12 06:27:19,262 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-12 06:27:19,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,283 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-12 06:27:19,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,295 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-12 06:27:19,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:27:19,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:27:19,351 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-12 06:27:19,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,364 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-12 06:27:19,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 06:27:19,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:27:19,414 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-12 06:27:19,414 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:100, output treesize:256 [2018-04-12 06:27:19,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,530 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-12 06:27:19,532 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-12 06:27:19,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,610 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-12 06:27:19,612 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-12 06:27:19,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:19,675 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-12 06:27:19,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 14 treesize of output 13 [2018-04-12 06:27:19,677 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,739 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-12 06:27:19,741 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-12 06:27:19,741 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,805 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-12 06:27:19,806 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:234, output treesize:194 [2018-04-12 06:27:19,927 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-12 06:27:19,930 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-12 06:27:19,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:19,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,014 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-12 06:27:20,017 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-12 06:27:20,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,084 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-12 06:27:20,087 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-12 06:27:20,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,152 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-12 06:27:20,155 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-12 06:27:20,155 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,168 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,212 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-12 06:27:20,212 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:285, output treesize:245 [2018-04-12 06:27:20,524 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-12 06:27:20,526 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,529 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-12 06:27:20,529 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-12 06:27:20,545 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-12 06:27:20,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,558 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-12 06:27:20,598 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-12 06:27:20,602 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-12 06:27:20,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,630 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-12 06:27:20,631 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-12 06:27:20,687 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-12 06:27:20,761 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-12 06:27:20,763 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-12 06:27:20,763 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,780 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,780 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-12 06:27:20,780 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,788 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,846 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-12 06:27:20,849 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-12 06:27:20,849 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,866 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,867 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 43 [2018-04-12 06:27:20,867 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,879 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,881 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-12 06:27:20,884 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-12 06:27:20,884 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:20,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:20,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-04-12 06:27:20,906 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,918 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:20,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-12 06:27:20,944 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:255, output treesize:21 [2018-04-12 06:27:20,992 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-12 06:27:20,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:27:20,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:27:20,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 06:27:20,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 06:27:20,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=265, Unknown=3, NotChecked=0, Total=342 [2018-04-12 06:27:20,993 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 19 states. [2018-04-12 06:27:21,981 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 78 DAG size of output 77 [2018-04-12 06:27:22,189 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-12 06:27:22,439 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-12 06:27:22,627 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 133 DAG size of output 90 [2018-04-12 06:27:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:27:23,478 INFO L93 Difference]: Finished difference Result 449 states and 538 transitions. [2018-04-12 06:27:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 06:27:23,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-04-12 06:27:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:27:23,479 INFO L225 Difference]: With dead ends: 449 [2018-04-12 06:27:23,479 INFO L226 Difference]: Without dead ends: 449 [2018-04-12 06:27:23,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=339, Invalid=1368, Unknown=15, NotChecked=0, Total=1722 [2018-04-12 06:27:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-12 06:27:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 313. [2018-04-12 06:27:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-12 06:27:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2018-04-12 06:27:23,485 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 48 [2018-04-12 06:27:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:27:23,485 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2018-04-12 06:27:23,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 06:27:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2018-04-12 06:27:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:27:23,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:27:23,486 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-12 06:27:23,486 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-12 06:27:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash -136940696, now seen corresponding path program 1 times [2018-04-12 06:27:23,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:27:23,486 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:27:23,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:23,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:23,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:23,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:27:23,543 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-12 06:27:23,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:27:23,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:27:23,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 06:27:23,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 06:27:23,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 06:27:23,544 INFO L87 Difference]: Start difference. First operand 313 states and 383 transitions. Second operand 7 states. [2018-04-12 06:27:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:27:23,667 INFO L93 Difference]: Finished difference Result 403 states and 486 transitions. [2018-04-12 06:27:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:27:23,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-12 06:27:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:27:23,668 INFO L225 Difference]: With dead ends: 403 [2018-04-12 06:27:23,668 INFO L226 Difference]: Without dead ends: 403 [2018-04-12 06:27:23,668 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-12 06:27:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-12 06:27:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 341. [2018-04-12 06:27:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-12 06:27:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2018-04-12 06:27:23,671 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 50 [2018-04-12 06:27:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:27:23,671 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2018-04-12 06:27:23,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 06:27:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2018-04-12 06:27:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:27:23,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:27:23,672 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-12 06:27:23,672 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-12 06:27:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1249262698, now seen corresponding path program 1 times [2018-04-12 06:27:23,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:27:23,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:27:23,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:23,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:23,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:27:23,677 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:27:23,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:27:23,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:27:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:23,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:27:23,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 6 treesize of output 5 [2018-04-12 06:27:23,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:27:23,709 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-12 06:27:23,711 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-12 06:27:23,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,722 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-12 06:27:23,723 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-12 06:27:23,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-12 06:27:23,744 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-12 06:27:23,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:23,748 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-12 06:27:23,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,765 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-12 06:27:23,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:23,768 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-12 06:27:23,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-12 06:27:23,817 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-12 06:27:23,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,827 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-12 06:27:23,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:45 [2018-04-12 06:27:23,850 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-12 06:27:23,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:23,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:23,853 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-12 06:27:23,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,868 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-12 06:27:23,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:23,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:23,884 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-12 06:27:23,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:23,891 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-12 06:27:23,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:7 [2018-04-12 06:27:23,905 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-12 06:27:23,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:27:23,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-12 06:27:23,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 06:27:23,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 06:27:23,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-12 06:27:23,906 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand 10 states. [2018-04-12 06:27:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:27:24,293 INFO L93 Difference]: Finished difference Result 339 states and 405 transitions. [2018-04-12 06:27:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:27:24,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-04-12 06:27:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:27:24,294 INFO L225 Difference]: With dead ends: 339 [2018-04-12 06:27:24,294 INFO L226 Difference]: Without dead ends: 327 [2018-04-12 06:27:24,294 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-12 06:27:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-12 06:27:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-04-12 06:27:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-04-12 06:27:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 384 transitions. [2018-04-12 06:27:24,298 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 384 transitions. Word has length 50 [2018-04-12 06:27:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:27:24,298 INFO L459 AbstractCegarLoop]: Abstraction has 317 states and 384 transitions. [2018-04-12 06:27:24,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 06:27:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 384 transitions. [2018-04-12 06:27:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:27:24,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:27:24,299 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-12 06:27:24,299 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-12 06:27:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412237, now seen corresponding path program 1 times [2018-04-12 06:27:24,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:27:24,300 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:27:24,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:24,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:27:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:24,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:27:24,312 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:27:24,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:27:24,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:27:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:27:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:27:24,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:27:24,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:24,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:24,368 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-12 06:27:24,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 06:27:24,392 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-12 06:27:24,393 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-12 06:27:24,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,403 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-12 06:27:24,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-12 06:27:24,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:27:24,431 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-12 06:27:24,433 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-12 06:27:24,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,444 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-12 06:27:24,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-12 06:27:24,475 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-12 06:27:24,477 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-12 06:27:24,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:24,490 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-12 06:27:24,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:56 [2018-04-12 06:27:32,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-04-12 06:27:32,570 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-12 06:27:32,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:32,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:27:32,574 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-12 06:27:32,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:27:32,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:27:32,582 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-12 06:27:32,582 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:15 [2018-04-12 06:27:32,624 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-12 06:27:32,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:27:32,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 06:27:32,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:27:32,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:27:32,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=181, Unknown=4, NotChecked=0, Total=240 [2018-04-12 06:27:32,625 INFO L87 Difference]: Start difference. First operand 317 states and 384 transitions. Second operand 16 states. [2018-04-12 06:28:08,943 WARN L151 SmtUtils]: Spent 4032ms on a formula simplification. DAG size of input: 63 DAG size of output 44 [2018-04-12 06:28:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:28:39,742 INFO L93 Difference]: Finished difference Result 709 states and 851 transitions. [2018-04-12 06:28:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 06:28:39,742 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-12 06:28:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:28:39,743 INFO L225 Difference]: With dead ends: 709 [2018-04-12 06:28:39,743 INFO L226 Difference]: Without dead ends: 709 [2018-04-12 06:28:39,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 62.6s TimeCoverageRelationStatistics Valid=310, Invalid=783, Unknown=29, NotChecked=0, Total=1122 [2018-04-12 06:28:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-04-12 06:28:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 410. [2018-04-12 06:28:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-12 06:28:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 509 transitions. [2018-04-12 06:28:39,747 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 509 transitions. Word has length 50 [2018-04-12 06:28:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:28:39,748 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 509 transitions. [2018-04-12 06:28:39,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:28:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 509 transitions. [2018-04-12 06:28:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:28:39,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:28:39,748 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-12 06:28:39,748 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-12 06:28:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412236, now seen corresponding path program 1 times [2018-04-12 06:28:39,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:28:39,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:28:39,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:28:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:28:39,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:28:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:28:39,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:28:39,759 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:28:39,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:28:39,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:28:39,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:28:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:28:39,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:28:39,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 6 treesize of output 5 [2018-04-12 06:28:39,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:28:39,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:39,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:39,804 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-12 06:28:39,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,815 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-12 06:28:39,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-12 06:28:39,839 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-12 06:28:39,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,850 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-12 06:28:39,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, 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-12 06:28:39,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,888 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-12 06:28:39,890 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-12 06:28:39,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,901 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-12 06:28:39,902 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:39 [2018-04-12 06:28:39,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:39,932 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-12 06:28:39,933 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-12 06:28:39,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:39,973 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-12 06:28:39,975 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-12 06:28:39,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:39,989 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-12 06:28:39,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2018-04-12 06:28:40,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:40,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:28:40,035 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-12 06:28:40,037 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-12 06:28:40,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:40,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:40,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:40,059 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:28:40,064 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-12 06:28:40,066 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-12 06:28:40,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:40,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:40,083 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-12 06:28:40,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:87 [2018-04-12 06:28:44,201 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-12 06:28:44,203 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:28:44,203 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-12 06:28:44,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:44,210 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-12 06:28:44,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:44,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:44,226 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-12 06:28:44,228 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-12 06:28:44,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:44,233 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:28:44,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 06:28:44,233 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:44,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:44,243 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-12 06:28:44,243 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:23 [2018-04-12 06:28:44,290 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-12 06:28:44,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:28:44,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 06:28:44,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:28:44,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:28:44,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=214, Unknown=2, NotChecked=0, Total=272 [2018-04-12 06:28:44,291 INFO L87 Difference]: Start difference. First operand 410 states and 509 transitions. Second operand 17 states. [2018-04-12 06:28:46,577 WARN L151 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 64 DAG size of output 57 [2018-04-12 06:28:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:28:47,708 INFO L93 Difference]: Finished difference Result 585 states and 693 transitions. [2018-04-12 06:28:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 06:28:47,708 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-12 06:28:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:28:47,709 INFO L225 Difference]: With dead ends: 585 [2018-04-12 06:28:47,709 INFO L226 Difference]: Without dead ends: 585 [2018-04-12 06:28:47,710 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-12 06:28:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-04-12 06:28:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 421. [2018-04-12 06:28:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-12 06:28:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2018-04-12 06:28:47,713 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 50 [2018-04-12 06:28:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:28:47,714 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2018-04-12 06:28:47,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:28:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2018-04-12 06:28:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:28:47,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:28:47,714 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-12 06:28:47,714 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-12 06:28:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash 721092915, now seen corresponding path program 1 times [2018-04-12 06:28:47,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:28:47,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:28:47,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:28:47,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:28:47,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:28:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:28:47,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:28:47,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:28:47,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:28:47,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:28:47,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:28:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:28:47,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:28:47,741 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-12 06:28:47,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:28:47,820 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-12 06:28:47,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-12 06:28:47,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:47,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:47,841 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-12 06:28:47,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2018-04-12 06:28:47,867 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-12 06:28:47,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,882 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-12 06:28:47,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:47,885 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-12 06:28:47,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,909 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-12 06:28:47,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:47,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, 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-12 06:28:47,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,924 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-12 06:28:47,924 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:72, output treesize:37 [2018-04-12 06:28:47,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:47,964 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-12 06:28:47,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:28:47,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,984 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-12 06:28:47,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:28:47,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:47,998 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-12 06:28:47,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-04-12 06:28:48,062 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-12 06:28:48,067 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-12 06:28:48,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:48,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:48,091 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-12 06:28:48,093 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-12 06:28:48,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:48,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:48,109 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-12 06:28:48,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:90 [2018-04-12 06:28:54,198 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-12 06:28:54,201 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-12 06:28:54,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:54,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:28:54,207 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:28:54,209 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-12 06:28:54,209 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-12 06:28:54,214 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-12 06:28:54,223 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-12 06:28:54,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:28:54,224 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-12 06:28:54,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:54,229 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-12 06:28:54,229 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:28:54,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:28:54,235 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-12 06:28:54,235 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:107, output treesize:7 [2018-04-12 06:28:54,264 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-12 06:28:54,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:28:54,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 06:28:54,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 06:28:54,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 06:28:54,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=260, Unknown=3, NotChecked=0, Total=306 [2018-04-12 06:28:54,265 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand 18 states. [2018-04-12 06:29:25,024 WARN L151 SmtUtils]: Spent 4040ms on a formula simplification. DAG size of input: 93 DAG size of output 60 [2018-04-12 06:29:49,647 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 82 DAG size of output 51 [2018-04-12 06:29:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:29:56,386 INFO L93 Difference]: Finished difference Result 606 states and 747 transitions. [2018-04-12 06:29:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 06:29:56,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-04-12 06:29:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:29:56,387 INFO L225 Difference]: With dead ends: 606 [2018-04-12 06:29:56,387 INFO L226 Difference]: Without dead ends: 606 [2018-04-12 06:29:56,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=400, Invalid=1466, Unknown=26, NotChecked=0, Total=1892 [2018-04-12 06:29:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-04-12 06:29:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 453. [2018-04-12 06:29:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-12 06:29:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2018-04-12 06:29:56,393 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 50 [2018-04-12 06:29:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:29:56,394 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2018-04-12 06:29:56,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 06:29:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2018-04-12 06:29:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 06:29:56,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:29:56,395 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-12 06:29:56,395 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-12 06:29:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash -660150828, now seen corresponding path program 1 times [2018-04-12 06:29:56,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:29:56,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:29:56,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:29:56,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:29:56,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:29:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:29:56,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:29:56,408 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:29:56,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:29:56,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:29:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:29:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:29:56,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:29:56,444 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-12 06:29:56,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,448 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-12 06:29:56,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-12 06:29:56,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:29:56,483 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-12 06:29:56,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:29:56,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:29:56,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, 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-12 06:29:56,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-12 06:29:56,521 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-12 06:29:56,522 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-12 06:29:56,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,530 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-12 06:29:56,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-04-12 06:29:56,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:29:56,558 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-12 06:29:56,559 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-12 06:29:56,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,573 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-12 06:29:56,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-12 06:29:56,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:29:56,650 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-12 06:29:56,653 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-12 06:29:56,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:29:56,666 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-12 06:29:56,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 [2018-04-12 06:30:02,692 WARN L151 SmtUtils]: Spent 2014ms on a formula simplification. DAG size of input: 31 DAG size of output 27 [2018-04-12 06:30:02,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-12 06:30:02,803 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-12 06:30:02,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:02,809 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 1 case distinctions, treesize of input 25 treesize of output 22 [2018-04-12 06:30:02,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:30:02,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:30:02,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:30:02,826 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:73 [2018-04-12 06:30:02,936 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-12 06:30:02,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:30:02,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 06:30:02,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:30:02,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:30:02,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=228, Unknown=2, NotChecked=0, Total=272 [2018-04-12 06:30:02,937 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand 17 states. [2018-04-12 06:30:05,216 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-04-12 06:30:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:06,140 INFO L93 Difference]: Finished difference Result 617 states and 748 transitions. [2018-04-12 06:30:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 06:30:06,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-04-12 06:30:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:06,142 INFO L225 Difference]: With dead ends: 617 [2018-04-12 06:30:06,142 INFO L226 Difference]: Without dead ends: 616 [2018-04-12 06:30:06,142 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=282, Invalid=906, Unknown=2, NotChecked=0, Total=1190 [2018-04-12 06:30:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-12 06:30:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 448. [2018-04-12 06:30:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-12 06:30:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 561 transitions. [2018-04-12 06:30:06,158 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 561 transitions. Word has length 52 [2018-04-12 06:30:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:06,158 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 561 transitions. [2018-04-12 06:30:06,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:30:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 561 transitions. [2018-04-12 06:30:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 06:30:06,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:06,159 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-12 06:30:06,159 INFO L408 AbstractCegarLoop]: === Iteration 32 === [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-12 06:30:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash -338982956, now seen corresponding path program 1 times [2018-04-12 06:30:06,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:06,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:06,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:06,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:06,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:06,169 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:06,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:06,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:06,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:06,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:06,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:06,214 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-12 06:30:06,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-12 06:30:06,266 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-12 06:30:06,268 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-12 06:30:06,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,289 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-12 06:30:06,291 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-12 06:30:06,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,304 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-12 06:30:06,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2018-04-12 06:30:06,320 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-04-12 06:30:06,322 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-12 06:30:06,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-04-12 06:30:06,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-04-12 06:30:06,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:06,376 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 29 treesize of output 38 [2018-04-12 06:30:06,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,399 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 30 treesize of output 29 [2018-04-12 06:30:06,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,416 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-12 06:30:06,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2018-04-12 06:30:06,466 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 63 [2018-04-12 06:30:06,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 55 treesize of output 54 [2018-04-12 06:30:06,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,490 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-12 06:30:06,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:61 [2018-04-12 06:30:06,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 53 [2018-04-12 06:30:06,572 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 41 treesize of output 29 [2018-04-12 06:30:06,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:06,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2018-04-12 06:30:06,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,622 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 29 treesize of output 14 [2018-04-12 06:30:06,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:06,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2018-04-12 06:30:06,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 06:30:06,714 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 17 treesize of output 10 [2018-04-12 06:30:06,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:06,725 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-12 06:30:06,725 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:15 [2018-04-12 06:30:06,770 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-12 06:30:06,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:30:06,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 06:30:06,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:30:06,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:30:06,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-12 06:30:06,770 INFO L87 Difference]: Start difference. First operand 448 states and 561 transitions. Second operand 16 states. [2018-04-12 06:30:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:08,139 INFO L93 Difference]: Finished difference Result 851 states and 1027 transitions. [2018-04-12 06:30:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 06:30:08,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-04-12 06:30:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:08,141 INFO L225 Difference]: With dead ends: 851 [2018-04-12 06:30:08,141 INFO L226 Difference]: Without dead ends: 851 [2018-04-12 06:30:08,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=887, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 06:30:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-04-12 06:30:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 492. [2018-04-12 06:30:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-04-12 06:30:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 615 transitions. [2018-04-12 06:30:08,146 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 615 transitions. Word has length 52 [2018-04-12 06:30:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:08,146 INFO L459 AbstractCegarLoop]: Abstraction has 492 states and 615 transitions. [2018-04-12 06:30:08,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:30:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 615 transitions. [2018-04-12 06:30:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 06:30:08,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:08,147 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-12 06:30:08,148 INFO L408 AbstractCegarLoop]: === Iteration 33 === [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-12 06:30:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash -338982955, now seen corresponding path program 1 times [2018-04-12 06:30:08,148 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:08,148 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:08,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:08,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:08,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:08,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:08,167 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:08,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:08,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:08,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:08,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:08,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:08,210 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-12 06:30:08,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:30:08,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-12 06:30:08,241 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-12 06:30:08,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,253 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-12 06:30:08,255 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-12 06:30:08,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,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 13 treesize of output 10 [2018-04-12 06:30:08,269 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-12 06:30:08,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,270 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,277 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-12 06:30:08,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2018-04-12 06:30:08,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:08,308 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 42 treesize of output 46 [2018-04-12 06:30:08,310 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-12 06:30:08,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:08,333 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 58 treesize of output 55 [2018-04-12 06:30:08,335 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-12 06:30:08,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,350 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-12 06:30:08,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:75 [2018-04-12 06:30:08,384 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 57 treesize of output 50 [2018-04-12 06:30:08,386 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-12 06:30:08,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,407 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 88 treesize of output 74 [2018-04-12 06:30:08,409 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-12 06:30:08,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:08,425 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-12 06:30:08,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:99 [2018-04-12 06:30:14,501 WARN L148 SmtUtils]: Spent 2065ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-12 06:30:18,531 WARN L148 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-12 06:30:18,554 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 61 [2018-04-12 06:30:18,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2018-04-12 06:30:18,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 06:30:18,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,586 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 38 [2018-04-12 06:30:18,588 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-12 06:30:18,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 06:30:18,595 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:18,602 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:117, output treesize:9 [2018-04-12 06:30:18,632 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-12 06:30:18,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:30:18,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 06:30:18,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 06:30:18,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 06:30:18,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=122, Unknown=3, NotChecked=0, Total=156 [2018-04-12 06:30:18,633 INFO L87 Difference]: Start difference. First operand 492 states and 615 transitions. Second operand 13 states. [2018-04-12 06:30:22,965 WARN L151 SmtUtils]: Spent 4059ms on a formula simplification. DAG size of input: 99 DAG size of output 67 [2018-04-12 06:30:27,043 WARN L151 SmtUtils]: Spent 4060ms on a formula simplification. DAG size of input: 97 DAG size of output 62 [2018-04-12 06:30:31,151 WARN L151 SmtUtils]: Spent 4097ms on a formula simplification. DAG size of input: 99 DAG size of output 64 [2018-04-12 06:30:35,249 WARN L151 SmtUtils]: Spent 4048ms on a formula simplification. DAG size of input: 84 DAG size of output 49 [2018-04-12 06:30:39,329 WARN L151 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 88 DAG size of output 53 [2018-04-12 06:30:43,497 WARN L151 SmtUtils]: Spent 4086ms on a formula simplification. DAG size of input: 93 DAG size of output 58 [2018-04-12 06:30:45,547 WARN L148 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-12 06:30:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:46,019 INFO L93 Difference]: Finished difference Result 792 states and 951 transitions. [2018-04-12 06:30:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:30:46,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-04-12 06:30:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:46,021 INFO L225 Difference]: With dead ends: 792 [2018-04-12 06:30:46,021 INFO L226 Difference]: Without dead ends: 792 [2018-04-12 06:30:46,021 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=117, Invalid=342, Unknown=3, NotChecked=0, Total=462 [2018-04-12 06:30:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-04-12 06:30:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 490. [2018-04-12 06:30:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-04-12 06:30:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 612 transitions. [2018-04-12 06:30:46,025 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 612 transitions. Word has length 52 [2018-04-12 06:30:46,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:46,026 INFO L459 AbstractCegarLoop]: Abstraction has 490 states and 612 transitions. [2018-04-12 06:30:46,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 06:30:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 612 transitions. [2018-04-12 06:30:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 06:30:46,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:46,026 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-12 06:30:46,027 INFO L408 AbstractCegarLoop]: === Iteration 34 === [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-12 06:30:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash -344708594, now seen corresponding path program 1 times [2018-04-12 06:30:46,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:46,027 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:46,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:46,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:46,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:46,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:30:46,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:46,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:30:46,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:30:46,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:30:46,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:30:46,083 INFO L87 Difference]: Start difference. First operand 490 states and 612 transitions. Second operand 6 states. [2018-04-12 06:30:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:30:46,189 INFO L93 Difference]: Finished difference Result 491 states and 609 transitions. [2018-04-12 06:30:46,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 06:30:46,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-12 06:30:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:30:46,190 INFO L225 Difference]: With dead ends: 491 [2018-04-12 06:30:46,190 INFO L226 Difference]: Without dead ends: 491 [2018-04-12 06:30:46,190 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-12 06:30:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-12 06:30:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 490. [2018-04-12 06:30:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-04-12 06:30:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 609 transitions. [2018-04-12 06:30:46,194 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 609 transitions. Word has length 52 [2018-04-12 06:30:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:30:46,194 INFO L459 AbstractCegarLoop]: Abstraction has 490 states and 609 transitions. [2018-04-12 06:30:46,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:30:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 609 transitions. [2018-04-12 06:30:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 06:30:46,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:30:46,194 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, 1, 1] [2018-04-12 06:30:46,194 INFO L408 AbstractCegarLoop]: === Iteration 35 === [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-12 06:30:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1911310923, now seen corresponding path program 1 times [2018-04-12 06:30:46,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:30:46,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:30:46,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:46,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:46,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:30:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:46,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:30:46,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:30:46,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:30:46,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:30:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:30:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:30:46,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:30:46,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:46,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:46,242 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-12 06:30:46,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-04-12 06:30:46,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-12 06:30:46,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,266 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-12 06:30:46,267 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 10 treesize of output 9 [2018-04-12 06:30:46,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,273 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-04-12 06:30:46,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:30:46,294 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 44 treesize of output 41 [2018-04-12 06:30:46,295 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-12 06:30:46,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,305 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-12 06:30:46,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-12 06:30:46,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 45 [2018-04-12 06:30:46,337 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-12 06:30:46,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:46,347 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-12 06:30:46,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:49 [2018-04-12 06:30:52,506 WARN L151 SmtUtils]: Spent 2142ms on a formula simplification. DAG size of input: 23 DAG size of output 19 [2018-04-12 06:30:54,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 31 [2018-04-12 06:30:54,537 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-12 06:30:54,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:54,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-12 06:30:54,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:30:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:54,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:30:54,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:4 [2018-04-12 06:30:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:30:54,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:30:54,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-12 06:30:54,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 06:30:54,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 06:30:54,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=122, Unknown=3, NotChecked=0, Total=156 [2018-04-12 06:30:54,572 INFO L87 Difference]: Start difference. First operand 490 states and 609 transitions. Second operand 13 states. [2018-04-12 06:31:22,842 WARN L151 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 60 DAG size of output 40 [2018-04-12 06:31:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:41,634 INFO L93 Difference]: Finished difference Result 762 states and 922 transitions. [2018-04-12 06:31:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 06:31:41,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-04-12 06:31:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:41,636 INFO L225 Difference]: With dead ends: 762 [2018-04-12 06:31:41,636 INFO L226 Difference]: Without dead ends: 762 [2018-04-12 06:31:41,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=168, Invalid=515, Unknown=19, NotChecked=0, Total=702 [2018-04-12 06:31:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-04-12 06:31:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 490. [2018-04-12 06:31:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-04-12 06:31:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 608 transitions. [2018-04-12 06:31:41,640 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 608 transitions. Word has length 54 [2018-04-12 06:31:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:41,640 INFO L459 AbstractCegarLoop]: Abstraction has 490 states and 608 transitions. [2018-04-12 06:31:41,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 06:31:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 608 transitions. [2018-04-12 06:31:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 06:31:41,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:41,640 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:31:41,641 INFO L408 AbstractCegarLoop]: === Iteration 36 === [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-12 06:31:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash -640106729, now seen corresponding path program 1 times [2018-04-12 06:31:41,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:41,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:41,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:41,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:41,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:41,655 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:41,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:41,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:41,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:41,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:41,715 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-12 06:31:41,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-12 06:31:41,732 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-12 06:31:41,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 06:31:41,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,748 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-12 06:31:41,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 06:31:41,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,761 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-12 06:31:41,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:30 [2018-04-12 06:31:41,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 64 [2018-04-12 06:31:41,813 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 62 treesize of output 61 [2018-04-12 06:31:41,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2018-04-12 06:31:41,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:41,862 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:41,862 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 41 treesize of output 77 [2018-04-12 06:31:41,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,876 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 33 treesize of output 32 [2018-04-12 06:31:41,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,891 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-12 06:31:41,891 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:88, output treesize:68 [2018-04-12 06:31:41,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-04-12 06:31:41,935 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 50 treesize of output 57 [2018-04-12 06:31:41,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:41,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 73 [2018-04-12 06:31:41,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 78 [2018-04-12 06:31:41,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:42,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 60 treesize of output 60 [2018-04-12 06:31:42,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 06:31:42,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:31:42,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 06:31:42,058 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:112, output treesize:146 [2018-04-12 06:31:42,344 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-04-12 06:31:42,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2018-04-12 06:31:42,374 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 37 treesize of output 32 [2018-04-12 06:31:42,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-12 06:31:42,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,409 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 1 case distinctions, treesize of input 29 treesize of output 29 [2018-04-12 06:31:42,410 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 25 treesize of output 16 [2018-04-12 06:31:42,411 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,421 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 16 treesize of output 11 [2018-04-12 06:31:42,421 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:42,429 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:42,429 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 21 treesize of output 14 [2018-04-12 06:31:42,429 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:42,438 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-12 06:31:42,438 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:16 [2018-04-12 06:31:42,469 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-12 06:31:42,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:42,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 06:31:42,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:31:42,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:31:42,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-04-12 06:31:42,469 INFO L87 Difference]: Start difference. First operand 490 states and 608 transitions. Second operand 17 states. [2018-04-12 06:31:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:31:44,068 INFO L93 Difference]: Finished difference Result 799 states and 969 transitions. [2018-04-12 06:31:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 06:31:44,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-04-12 06:31:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:31:44,070 INFO L225 Difference]: With dead ends: 799 [2018-04-12 06:31:44,070 INFO L226 Difference]: Without dead ends: 799 [2018-04-12 06:31:44,070 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 06:31:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-12 06:31:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 528. [2018-04-12 06:31:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-12 06:31:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 654 transitions. [2018-04-12 06:31:44,074 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 654 transitions. Word has length 56 [2018-04-12 06:31:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:31:44,074 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 654 transitions. [2018-04-12 06:31:44,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:31:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 654 transitions. [2018-04-12 06:31:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 06:31:44,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:31:44,075 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:31:44,075 INFO L408 AbstractCegarLoop]: === Iteration 37 === [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-12 06:31:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -645832368, now seen corresponding path program 1 times [2018-04-12 06:31:44,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:31:44,075 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:31:44,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:44,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:31:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:44,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:31:44,084 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:31:44,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:31:44,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:31:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:31:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:31:44,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:31:44,124 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-12 06:31:44,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:31:44,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:31:44,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 06:31:44,184 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-12 06:31:44,186 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-12 06:31:44,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,205 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-12 06:31:44,207 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-12 06:31:44,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,221 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-12 06:31:44,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:39 [2018-04-12 06:31:44,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-12 06:31:44,241 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-12 06:31:44,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-12 06:31:44,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,276 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 37 treesize of output 44 [2018-04-12 06:31:44,277 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-12 06:31:44,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,291 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-12 06:31:44,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-12 06:31:44,327 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:44,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-12 06:31:44,336 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-12 06:31:44,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,352 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-12 06:31:44,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-04-12 06:31:44,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-12 06:31:44,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,393 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-12 06:31:44,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:66 [2018-04-12 06:31:44,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-12 06:31:44,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-04-12 06:31:44,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:31:44,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:84 [2018-04-12 06:31:44,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:44,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 105 [2018-04-12 06:31:44,532 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-12 06:31:44,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,553 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-12 06:31:44,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:97 [2018-04-12 06:31:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 91 [2018-04-12 06:31:44,630 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-12 06:31:44,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:31:44,653 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-12 06:31:44,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:106 [2018-04-12 06:31:50,706 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 43 DAG size of output 39 [2018-04-12 06:31:54,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-04-12 06:31:54,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:31:54,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:31:54,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-12 06:31:54,847 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-12 06:31:54,854 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-12 06:31:54,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:54,859 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-12 06:31:54,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:31:54,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:31:54,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:31:54,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:28 [2018-04-12 06:31:54,958 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-12 06:31:54,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:31:54,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:31:54,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 06:31:54,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 06:31:54,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=304, Unknown=4, NotChecked=0, Total=380 [2018-04-12 06:31:54,959 INFO L87 Difference]: Start difference. First operand 528 states and 654 transitions. Second operand 20 states. [2018-04-12 06:32:19,887 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 75 DAG size of output 66 [2018-04-12 06:32:32,062 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 89 DAG size of output 69 [2018-04-12 06:32:34,195 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 118 DAG size of output 74 [2018-04-12 06:32:40,402 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 113 DAG size of output 72 [2018-04-12 06:32:53,121 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 127 DAG size of output 75 [2018-04-12 06:33:12,202 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 102 DAG size of output 61 [2018-04-12 06:34:12,852 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 107 DAG size of output 63 [2018-04-12 06:34:19,071 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 109 DAG size of output 68 [2018-04-12 06:34:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:34:19,187 INFO L93 Difference]: Finished difference Result 1543 states and 1881 transitions. [2018-04-12 06:34:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 06:34:19,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-04-12 06:34:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:34:19,190 INFO L225 Difference]: With dead ends: 1543 [2018-04-12 06:34:19,190 INFO L226 Difference]: Without dead ends: 1543 [2018-04-12 06:34:19,190 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 121.5s TimeCoverageRelationStatistics Valid=855, Invalid=2747, Unknown=58, NotChecked=0, Total=3660 [2018-04-12 06:34:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2018-04-12 06:34:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1018. [2018-04-12 06:34:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-04-12 06:34:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1284 transitions. [2018-04-12 06:34:19,200 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1284 transitions. Word has length 56 [2018-04-12 06:34:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:34:19,200 INFO L459 AbstractCegarLoop]: Abstraction has 1018 states and 1284 transitions. [2018-04-12 06:34:19,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 06:34:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1284 transitions. [2018-04-12 06:34:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 06:34:19,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:34:19,201 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:34:19,201 INFO L408 AbstractCegarLoop]: === Iteration 38 === [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-12 06:34:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash -645832367, now seen corresponding path program 1 times [2018-04-12 06:34:19,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:34:19,201 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:34:19,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:19,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:19,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:19,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:34:19,211 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:34:19,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:34:19,211 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:34:19,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:19,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:34:19,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:19,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:19,277 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-12 06:34:19,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:34:19,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-12 06:34:19,335 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-12 06:34:19,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:34:19,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,359 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-12 06:34:19,361 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-12 06:34:19,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,379 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-12 06:34:19,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:51 [2018-04-12 06:34:19,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:19,443 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 65 treesize of output 72 [2018-04-12 06:34:19,446 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-12 06:34:19,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:19,481 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-12 06:34:19,483 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-12 06:34:19,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,506 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-12 06:34:19,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-04-12 06:34:19,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:19,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:19,599 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 40 treesize of output 46 [2018-04-12 06:34:19,603 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-12 06:34:19,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:19,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:19,650 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 83 treesize of output 84 [2018-04-12 06:34:19,653 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-12 06:34:19,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:19,681 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-12 06:34:19,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:99 [2018-04-12 06:34:23,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 06:34:23,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12 06:34:23,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:23,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:83 [2018-04-12 06:34:23,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-12 06:34:23,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,797 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-12 06:34:23,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-12 06:34:23,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 78 [2018-04-12 06:34:23,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:23,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:107 [2018-04-12 06:34:23,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2018-04-12 06:34:23,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:34:23,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:23,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 133 [2018-04-12 06:34:23,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:34:23,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:23,994 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-12 06:34:23,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:165, output treesize:145 [2018-04-12 06:34:24,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 144 [2018-04-12 06:34:24,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,099 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 22 treesize of output 35 [2018-04-12 06:34:24,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 101 [2018-04-12 06:34:24,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,149 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 22 treesize of output 35 [2018-04-12 06:34:24,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,184 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-12 06:34:24,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:198, output treesize:178 [2018-04-12 06:34:24,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 122 [2018-04-12 06:34:24,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:24,497 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 85 [2018-04-12 06:34:24,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-12 06:34:24,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 06:34:24,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 86 [2018-04-12 06:34:24,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 06:34:24,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,614 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 64 treesize of output 58 [2018-04-12 06:34:24,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 80 [2018-04-12 06:34:24,625 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 06:34:24,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-12 06:34:24,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-12 06:34:24,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:24,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,751 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 32 treesize of output 19 [2018-04-12 06:34:24,751 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,768 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 13 treesize of output 6 [2018-04-12 06:34:24,768 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,780 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-12 06:34:24,780 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 81 [2018-04-12 06:34:24,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,796 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 13 treesize of output 6 [2018-04-12 06:34:24,796 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,812 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:24,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,813 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 32 treesize of output 19 [2018-04-12 06:34:24,813 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,824 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-12 06:34:24,824 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-12 06:34:24,838 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-12 06:34:24,838 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,853 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 13 treesize of output 6 [2018-04-12 06:34:24,853 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,866 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:24,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,867 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 32 treesize of output 19 [2018-04-12 06:34:24,867 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,883 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-12 06:34:24,888 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-12 06:34:24,888 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:24,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,904 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 32 treesize of output 19 [2018-04-12 06:34:24,904 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:24,916 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 13 treesize of output 6 [2018-04-12 06:34:24,916 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,924 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:24,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-12 06:34:24,962 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 8 variables, input treesize:206, output treesize:105 [2018-04-12 06:34:25,105 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-12 06:34:25,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:34:25,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 06:34:25,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 06:34:25,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 06:34:25,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2018-04-12 06:34:25,106 INFO L87 Difference]: Start difference. First operand 1018 states and 1284 transitions. Second operand 25 states. [2018-04-12 06:34:27,584 WARN L151 SmtUtils]: Spent 2036ms on a formula simplification. DAG size of input: 65 DAG size of output 56 [2018-04-12 06:34:28,511 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 118 DAG size of output 87 [2018-04-12 06:34:29,299 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 175 DAG size of output 103 [2018-04-12 06:34:29,461 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 175 DAG size of output 99 [2018-04-12 06:34:29,947 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 179 DAG size of output 100 [2018-04-12 06:34:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:34:31,653 INFO L93 Difference]: Finished difference Result 1505 states and 1865 transitions. [2018-04-12 06:34:31,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 06:34:31,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-04-12 06:34:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:34:31,655 INFO L225 Difference]: With dead ends: 1505 [2018-04-12 06:34:31,655 INFO L226 Difference]: Without dead ends: 1505 [2018-04-12 06:34:31,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=854, Invalid=2804, Unknown=2, NotChecked=0, Total=3660 [2018-04-12 06:34:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-04-12 06:34:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1219. [2018-04-12 06:34:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-04-12 06:34:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1542 transitions. [2018-04-12 06:34:31,663 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1542 transitions. Word has length 56 [2018-04-12 06:34:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:34:31,663 INFO L459 AbstractCegarLoop]: Abstraction has 1219 states and 1542 transitions. [2018-04-12 06:34:31,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 06:34:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1542 transitions. [2018-04-12 06:34:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 06:34:31,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:34:31,664 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:34:31,664 INFO L408 AbstractCegarLoop]: === Iteration 39 === [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-12 06:34:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1997127379, now seen corresponding path program 1 times [2018-04-12 06:34:31,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:34:31,664 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:34:31,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:31,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:31,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:31,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:34:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:34:31,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:34:31,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:34:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:31,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:34:31,706 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-12 06:34:31,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:31,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:31,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-12 06:34:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:34:31,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:34:31,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-04-12 06:34:31,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 06:34:31,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 06:34:31,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-12 06:34:31,711 INFO L87 Difference]: Start difference. First operand 1219 states and 1542 transitions. Second operand 7 states. [2018-04-12 06:34:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:34:31,852 INFO L93 Difference]: Finished difference Result 1262 states and 1588 transitions. [2018-04-12 06:34:31,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:34:31,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-04-12 06:34:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:34:31,855 INFO L225 Difference]: With dead ends: 1262 [2018-04-12 06:34:31,855 INFO L226 Difference]: Without dead ends: 1262 [2018-04-12 06:34:31,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-12 06:34:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-04-12 06:34:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1216. [2018-04-12 06:34:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-04-12 06:34:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1536 transitions. [2018-04-12 06:34:31,862 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1536 transitions. Word has length 57 [2018-04-12 06:34:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:34:31,862 INFO L459 AbstractCegarLoop]: Abstraction has 1216 states and 1536 transitions. [2018-04-12 06:34:31,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 06:34:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1536 transitions. [2018-04-12 06:34:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 06:34:31,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:34:31,863 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:34:31,863 INFO L408 AbstractCegarLoop]: === Iteration 40 === [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-12 06:34:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1997127378, now seen corresponding path program 1 times [2018-04-12 06:34:31,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:34:31,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:34:31,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:31,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:31,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:34:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:34:31,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:34:31,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:34:31,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:31,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:34:31,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:34:31,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:31,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:31,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:34:31,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:31,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:31,998 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-12 06:34:31,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:32,006 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-12 06:34:32,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:32,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:32,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-04-12 06:34:32,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:34:32,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:32,048 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-12 06:34:32,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-04-12 06:34:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:34:32,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:34:32,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-04-12 06:34:32,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:34:32,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:34:32,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-04-12 06:34:32,151 INFO L87 Difference]: Start difference. First operand 1216 states and 1536 transitions. Second operand 17 states. [2018-04-12 06:34:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:34:32,937 INFO L93 Difference]: Finished difference Result 1458 states and 1817 transitions. [2018-04-12 06:34:32,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:34:32,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-04-12 06:34:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:34:32,940 INFO L225 Difference]: With dead ends: 1458 [2018-04-12 06:34:32,940 INFO L226 Difference]: Without dead ends: 1458 [2018-04-12 06:34:32,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=728, Unknown=1, NotChecked=0, Total=992 [2018-04-12 06:34:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-04-12 06:34:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1237. [2018-04-12 06:34:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-04-12 06:34:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1561 transitions. [2018-04-12 06:34:32,947 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1561 transitions. Word has length 57 [2018-04-12 06:34:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:34:32,948 INFO L459 AbstractCegarLoop]: Abstraction has 1237 states and 1561 transitions. [2018-04-12 06:34:32,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:34:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1561 transitions. [2018-04-12 06:34:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 06:34:32,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:34:32,948 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, 1, 1, 1, 1, 1, 1] [2018-04-12 06:34:32,948 INFO L408 AbstractCegarLoop]: === Iteration 41 === [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-12 06:34:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1000935743, now seen corresponding path program 1 times [2018-04-12 06:34:32,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:34:32,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:34:32,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:32,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:32,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:34:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:32,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:34:32,960 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:34:32,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:34:32,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:34:32,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:34:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:34:33,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:34:33,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:33,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:33,037 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-12 06:34:33,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 06:34:33,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, 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-12 06:34:33,053 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-12 06:34:33,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,060 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-12 06:34:33,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-12 06:34:33,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:33,083 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-12 06:34:33,084 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-12 06:34:33,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,094 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-12 06:34:33,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-04-12 06:34:33,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:33,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:33,129 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:33,134 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 50 treesize of output 51 [2018-04-12 06:34:33,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 06:34:33,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:33,147 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-12 06:34:33,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:56 [2018-04-12 06:34:39,172 WARN L151 SmtUtils]: Spent 2013ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-04-12 06:34:39,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-12 06:34:39,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,186 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-12 06:34:39,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:65 [2018-04-12 06:34:39,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 06:34:39,209 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-12 06:34:39,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-04-12 06:34:39,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2018-04-12 06:34:39,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:39,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:89 [2018-04-12 06:34:39,336 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 101 [2018-04-12 06:34:39,341 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-12 06:34:39,483 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 74 treesize of output 73 [2018-04-12 06:34:39,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,552 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:39,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 75 [2018-04-12 06:34:39,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:39,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 06:34:39,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 43 [2018-04-12 06:34:39,641 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 34 treesize of output 33 [2018-04-12 06:34:39,641 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,656 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:39,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-12 06:34:39,694 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:123, output treesize:336 [2018-04-12 06:34:39,834 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 104 DAG size of output 75 [2018-04-12 06:34:39,954 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 5 new quantified variables, introduced 11 case distinctions, treesize of input 144 treesize of output 177 [2018-04-12 06:34:39,955 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-12 06:34:39,966 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:39,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:39,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 168 [2018-04-12 06:34:39,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:34:41,332 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 141 treesize of output 140 [2018-04-12 06:34:41,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:41,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:41,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:41,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 158 [2018-04-12 06:34:41,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:34:41,936 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:42,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-12 06:34:42,804 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 149 [2018-04-12 06:34:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 132 [2018-04-12 06:34:42,808 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:42,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 138 [2018-04-12 06:34:43,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:34:43,165 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-12 06:34:43,529 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 3 case distinctions, treesize of input 124 treesize of output 130 [2018-04-12 06:34:43,532 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 125 treesize of output 124 [2018-04-12 06:34:43,533 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,583 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,585 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:43,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 107 treesize of output 105 [2018-04-12 06:34:43,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,588 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:43,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 33 [2018-04-12 06:34:43,588 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,604 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 130 treesize of output 119 [2018-04-12 06:34:43,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-12 06:34:43,611 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,633 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,941 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 152 treesize of output 144 [2018-04-12 06:34:43,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:43,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-12 06:34:43,946 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,970 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:43,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 144 [2018-04-12 06:34:43,979 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 32 treesize of output 25 [2018-04-12 06:34:43,979 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,000 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,003 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:44,005 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 127 treesize of output 127 [2018-04-12 06:34:44,006 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:44,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 23 [2018-04-12 06:34:44,007 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,025 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 140 treesize of output 163 [2018-04-12 06:34:44,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,053 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 0 case distinctions, treesize of input 135 treesize of output 162 [2018-04-12 06:34:44,053 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,326 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 137 treesize of output 136 [2018-04-12 06:34:44,326 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,361 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,362 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:44,363 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 126 treesize of output 127 [2018-04-12 06:34:44,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:44,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 42 [2018-04-12 06:34:44,366 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,386 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,399 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 4 case distinctions, treesize of input 146 treesize of output 152 [2018-04-12 06:34:44,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:44,404 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 0 case distinctions, treesize of input 138 treesize of output 165 [2018-04-12 06:34:44,404 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,485 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 137 treesize of output 130 [2018-04-12 06:34:44,485 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,516 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:44,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 38 dim-0 vars, and 9 xjuncts. [2018-04-12 06:34:44,785 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 14 variables, input treesize:273, output treesize:1029 [2018-04-12 06:34:46,112 WARN L151 SmtUtils]: Spent 1039ms on a formula simplification. DAG size of input: 330 DAG size of output 152 [2018-04-12 06:34:46,427 WARN L148 SmtUtils]: Spent 190ms on a formula simplification that was a NOOP. DAG size: 151 [2018-04-12 06:34:46,632 WARN L148 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 158 [2018-04-12 06:34:47,880 WARN L151 SmtUtils]: Spent 1139ms on a formula simplification. DAG size of input: 400 DAG size of output 211 [2018-04-12 06:34:48,330 WARN L148 SmtUtils]: Spent 387ms on a formula simplification that was a NOOP. DAG size: 155 [2018-04-12 06:34:48,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 105 treesize of output 101 [2018-04-12 06:34:48,340 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-12 06:34:48,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 145 [2018-04-12 06:34:48,452 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 137 treesize of output 130 [2018-04-12 06:34:48,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,558 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 126 treesize of output 121 [2018-04-12 06:34:48,559 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 114 [2018-04-12 06:34:48,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 103 [2018-04-12 06:34:48,853 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-12 06:34:48,853 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:34:48,869 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-12 06:34:48,869 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,881 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:48,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:48,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 147 [2018-04-12 06:34:48,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 139 treesize of output 132 [2018-04-12 06:34:48,964 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:49,051 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 131 treesize of output 124 [2018-04-12 06:34:49,051 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:49,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2018-04-12 06:34:49,134 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:49,215 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 109 treesize of output 104 [2018-04-12 06:34:49,215 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:49,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:49,264 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 112 treesize of output 106 [2018-04-12 06:34:49,264 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:49,319 INFO L267 ElimStorePlain]: Start of recursive call 11: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:34:49,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: 18 dim-0 vars, and 4 xjuncts. [2018-04-12 06:34:49,387 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 22 variables, input treesize:481, output treesize:375 [2018-04-12 06:34:49,785 WARN L151 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 130 DAG size of output 79 [2018-04-12 06:34:49,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 120 [2018-04-12 06:34:49,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:49,810 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 91 treesize of output 78 [2018-04-12 06:34:49,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:50,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:50,223 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:50,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-04-12 06:34:50,224 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-12 06:34:50,641 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 97 treesize of output 92 [2018-04-12 06:34:50,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:51,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,046 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:51,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2018-04-12 06:34:51,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:51,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:51,476 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:51,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 101 [2018-04-12 06:34:51,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:51,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:51,913 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:51,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2018-04-12 06:34:51,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:52,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:52,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:52,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:52,326 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:52,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 100 [2018-04-12 06:34:52,331 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:34:52,781 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 73 treesize of output 59 [2018-04-12 06:34:52,781 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:53,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,205 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 99 treesize of output 93 [2018-04-12 06:34:53,205 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:53,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:53,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:53,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:53,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2018-04-12 06:34:53,649 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:54,069 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 95 treesize of output 88 [2018-04-12 06:34:54,069 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:54,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,493 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:54,493 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:54,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 99 [2018-04-12 06:34:54,494 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:54,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:54,918 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 87 treesize of output 74 [2018-04-12 06:34:54,918 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:55,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:55,322 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:55,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-12 06:34:55,322 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:55,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:55,713 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:55,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 73 [2018-04-12 06:34:55,714 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:56,095 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 77 treesize of output 72 [2018-04-12 06:34:56,095 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:56,096 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 71 treesize of output 66 [2018-04-12 06:34:56,097 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:56,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:56,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:56,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 97 [2018-04-12 06:34:56,481 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:56,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:56,861 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:56,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 109 [2018-04-12 06:34:56,872 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 06:34:57,314 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 72 treesize of output 65 [2018-04-12 06:34:57,314 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:57,353 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 66 treesize of output 59 [2018-04-12 06:34:57,354 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:57,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:57,759 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 93 treesize of output 80 [2018-04-12 06:34:57,759 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:58,162 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 66 treesize of output 61 [2018-04-12 06:34:58,162 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:58,164 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 75 treesize of output 70 [2018-04-12 06:34:58,164 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:58,165 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 78 treesize of output 73 [2018-04-12 06:34:58,165 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:58,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:58,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 89 [2018-04-12 06:34:58,549 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:58,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:34:58,954 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:58,955 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:34:58,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2018-04-12 06:34:58,955 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:34:59,354 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 82 treesize of output 75 [2018-04-12 06:34:59,355 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 06:34:59,742 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 75 treesize of output 70 [2018-04-12 06:34:59,742 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:00,125 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 70 treesize of output 63 [2018-04-12 06:35:00,126 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:00,496 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 78 treesize of output 66 [2018-04-12 06:35:00,496 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:00,878 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 66 treesize of output 59 [2018-04-12 06:35:00,878 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:01,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:01,367 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:35:01,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 81 [2018-04-12 06:35:01,369 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:35:01,834 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 66 treesize of output 59 [2018-04-12 06:35:01,834 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:02,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:02,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:02,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:02,209 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:35:02,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 96 [2018-04-12 06:35:02,213 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:35:02,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:02,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:35:02,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-04-12 06:35:02,607 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:35:02,988 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 67 treesize of output 55 [2018-04-12 06:35:02,988 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:02,990 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 73 treesize of output 61 [2018-04-12 06:35:02,990 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:03,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:03,335 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 74 treesize of output 61 [2018-04-12 06:35:03,335 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:03,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 34 dim-1 vars, End of recursive call: 17 dim-0 vars, and 19 xjuncts. [2018-04-12 06:35:04,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 85 [2018-04-12 06:35:04,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:04,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:35:04,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-04-12 06:35:04,049 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:04,085 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 78 treesize of output 73 [2018-04-12 06:35:04,086 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:04,116 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 73 treesize of output 66 [2018-04-12 06:35:04,116 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:04,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:35:04,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:35:04,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-04-12 06:35:04,146 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:04,174 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 53 treesize of output 41 [2018-04-12 06:35:04,174 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-12 06:35:04,189 INFO L267 ElimStorePlain]: Start of recursive call 42: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:35:04,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 38 dim-0 vars, and 19 xjuncts. [2018-04-12 06:35:04,533 INFO L202 ElimStorePlain]: Needed 47 recursive calls to eliminate 15 variables, input treesize:198, output treesize:560 [2018-04-12 06:35:04,736 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-12 06:35:04,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:35:04,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 06:35:04,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 06:35:04,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 06:35:04,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=484, Unknown=5, NotChecked=0, Total=600 [2018-04-12 06:35:04,737 INFO L87 Difference]: Start difference. First operand 1237 states and 1561 transitions. Second operand 25 states. [2018-04-12 06:35:21,398 WARN L151 SmtUtils]: Spent 2020ms on a formula simplification. DAG size of input: 45 DAG size of output 39 [2018-04-12 06:35:28,305 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 83 DAG size of output 83 [2018-04-12 06:35:31,357 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 110 DAG size of output 85 [2018-04-12 06:35:31,787 WARN L151 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 237 DAG size of output 164 [2018-04-12 06:35:32,070 WARN L148 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 155 [2018-04-12 06:35:32,806 WARN L151 SmtUtils]: Spent 507ms on a formula simplification. DAG size of input: 232 DAG size of output 159 [2018-04-12 06:35:41,026 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 53 DAG size of output 51 [2018-04-12 06:35:41,519 WARN L151 SmtUtils]: Spent 422ms on a formula simplification. DAG size of input: 239 DAG size of output 165 [2018-04-12 06:35:52,155 WARN L151 SmtUtils]: Spent 2454ms on a formula simplification. DAG size of input: 361 DAG size of output 182 [2018-04-12 06:36:02,776 WARN L151 SmtUtils]: Spent 381ms on a formula simplification. DAG size of input: 375 DAG size of output 111 [2018-04-12 06:36:06,888 WARN L151 SmtUtils]: Spent 2047ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-04-12 06:36:08,649 WARN L151 SmtUtils]: Spent 1687ms on a formula simplification. DAG size of input: 280 DAG size of output 164 [2018-04-12 06:36:09,394 WARN L151 SmtUtils]: Spent 505ms on a formula simplification. DAG size of input: 297 DAG size of output 167 [2018-04-12 06:36:09,850 WARN L151 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 172 DAG size of output 163 [2018-04-12 06:36:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:10,842 INFO L93 Difference]: Finished difference Result 1969 states and 2432 transitions. [2018-04-12 06:36:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 06:36:10,842 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-04-12 06:36:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:10,855 INFO L225 Difference]: With dead ends: 1969 [2018-04-12 06:36:10,855 INFO L226 Difference]: Without dead ends: 1969 [2018-04-12 06:36:10,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 62.3s TimeCoverageRelationStatistics Valid=711, Invalid=2806, Unknown=23, NotChecked=0, Total=3540 [2018-04-12 06:36:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-04-12 06:36:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1452. [2018-04-12 06:36:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2018-04-12 06:36:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1835 transitions. [2018-04-12 06:36:10,868 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1835 transitions. Word has length 58 [2018-04-12 06:36:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:10,868 INFO L459 AbstractCegarLoop]: Abstraction has 1452 states and 1835 transitions. [2018-04-12 06:36:10,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 06:36:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1835 transitions. [2018-04-12 06:36:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 06:36:10,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:10,869 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, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:10,869 INFO L408 AbstractCegarLoop]: === Iteration 42 === [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-12 06:36:10,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1000935744, now seen corresponding path program 1 times [2018-04-12 06:36:10,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:10,869 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:10,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:10,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:10,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:10,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:10,880 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:10,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:10,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:10,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:10,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:10,903 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-12 06:36:10,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:10,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:10,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:36:10,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:10,933 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-12 06:36:10,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:10,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:10,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:10,960 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-12 06:36:10,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:10,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:10,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-12 06:36:10,991 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-12 06:36:10,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:36:10,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:10,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,013 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-12 06:36:11,015 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-12 06:36:11,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,031 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-12 06:36:11,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-12 06:36:11,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:11,111 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 65 treesize of output 72 [2018-04-12 06:36:11,114 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-12 06:36:11,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,155 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-12 06:36:11,157 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-12 06:36:11,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,178 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-12 06:36:11,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:75 [2018-04-12 06:36:11,244 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:11,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 84 [2018-04-12 06:36:11,259 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-12 06:36:11,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,299 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 40 treesize of output 35 [2018-04-12 06:36:11,303 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-12 06:36:11,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:11,323 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-12 06:36:11,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:117, output treesize:101 [2018-04-12 06:36:15,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,393 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 0 case distinctions, treesize of input 28 treesize of output 50 [2018-04-12 06:36:15,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-04-12 06:36:15,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:15,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:108 [2018-04-12 06:36:15,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-12 06:36:15,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-04-12 06:36:15,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-04-12 06:36:15,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-12 06:36:15,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,526 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-12 06:36:15,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:15,547 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:139, output treesize:107 [2018-04-12 06:36:15,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-04-12 06:36:15,614 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-12 06:36:15,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:15,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 115 [2018-04-12 06:36:15,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:36:15,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,671 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-12 06:36:15,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:133 [2018-04-12 06:36:15,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-04-12 06:36:15,769 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-12 06:36:15,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 134 [2018-04-12 06:36:15,806 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-12 06:36:15,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:15,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:15,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:180, output treesize:160 [2018-04-12 06:36:24,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 112 [2018-04-12 06:36:24,004 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:24,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2018-04-12 06:36:24,005 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-12 06:36:24,019 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-12 06:36:24,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:24,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, 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-12 06:36:24,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:24,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:24,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-04-12 06:36:24,068 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:24,068 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-12 06:36:24,068 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:24,075 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-12 06:36:24,076 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:24,081 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-12 06:36:24,082 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:24,083 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:24,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:24,091 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:177, output treesize:36 [2018-04-12 06:36:24,167 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-12 06:36:24,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:24,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 06:36:24,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 06:36:24,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 06:36:24,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=401, Unknown=6, NotChecked=0, Total=506 [2018-04-12 06:36:24,168 INFO L87 Difference]: Start difference. First operand 1452 states and 1835 transitions. Second operand 23 states. [2018-04-12 06:36:26,599 WARN L151 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 68 DAG size of output 59 [2018-04-12 06:36:31,770 WARN L151 SmtUtils]: Spent 4082ms on a formula simplification. DAG size of input: 139 DAG size of output 92 [2018-04-12 06:36:34,867 WARN L151 SmtUtils]: Spent 2063ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-04-12 06:36:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:35,394 INFO L93 Difference]: Finished difference Result 1908 states and 2378 transitions. [2018-04-12 06:36:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 06:36:35,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-04-12 06:36:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:35,397 INFO L225 Difference]: With dead ends: 1908 [2018-04-12 06:36:35,397 INFO L226 Difference]: Without dead ends: 1908 [2018-04-12 06:36:35,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=648, Invalid=2102, Unknown=6, NotChecked=0, Total=2756 [2018-04-12 06:36:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2018-04-12 06:36:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1672. [2018-04-12 06:36:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-04-12 06:36:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2118 transitions. [2018-04-12 06:36:35,408 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2118 transitions. Word has length 58 [2018-04-12 06:36:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:35,409 INFO L459 AbstractCegarLoop]: Abstraction has 1672 states and 2118 transitions. [2018-04-12 06:36:35,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 06:36:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2118 transitions. [2018-04-12 06:36:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 06:36:35,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:35,409 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:35,409 INFO L408 AbstractCegarLoop]: === Iteration 43 === [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-12 06:36:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1025221117, now seen corresponding path program 2 times [2018-04-12 06:36:35,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:35,409 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:35,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:35,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:35,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:35,416 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:35,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:35,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:36:35,432 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:36:35,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:36:35,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:35,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,456 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-12 06:36:35,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-12 06:36:35,485 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-12 06:36:35,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,497 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-12 06:36:35,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 8 treesize of output 7 [2018-04-12 06:36:35,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,509 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-12 06:36:35,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:36:35,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,519 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-12 06:36:35,520 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:57, output treesize:28 [2018-04-12 06:36:35,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,551 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 47 treesize of output 46 [2018-04-12 06:36:35,553 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-12 06:36:35,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,575 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 34 treesize of output 38 [2018-04-12 06:36:35,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 06:36:35,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,588 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-12 06:36:35,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:60 [2018-04-12 06:36:35,626 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 81 treesize of output 71 [2018-04-12 06:36:35,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,628 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 24 treesize of output 39 [2018-04-12 06:36:35,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,651 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 68 treesize of output 63 [2018-04-12 06:36:35,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,653 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 24 treesize of output 39 [2018-04-12 06:36:35,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,670 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-12 06:36:35,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:91 [2018-04-12 06:36:35,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:35,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-04-12 06:36:35,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,832 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:35,832 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 26 treesize of output 35 [2018-04-12 06:36:35,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:35,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-04-12 06:36:35,845 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-12 06:36:35,852 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-12 06:36:35,865 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 36 [2018-04-12 06:36:35,866 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:35,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-12 06:36:35,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:35,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:35,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:35,876 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 19 [2018-04-12 06:36:35,877 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:35,887 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-12 06:36:35,888 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:118, output treesize:7 [2018-04-12 06:36:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:35,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:35,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 06:36:35,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:36:35,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:36:35,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-04-12 06:36:35,941 INFO L87 Difference]: Start difference. First operand 1672 states and 2118 transitions. Second operand 17 states. [2018-04-12 06:36:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:37,434 INFO L93 Difference]: Finished difference Result 1907 states and 2376 transitions. [2018-04-12 06:36:37,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 06:36:37,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-12 06:36:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:37,437 INFO L225 Difference]: With dead ends: 1907 [2018-04-12 06:36:37,438 INFO L226 Difference]: Without dead ends: 1907 [2018-04-12 06:36:37,438 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 06:36:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2018-04-12 06:36:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1681. [2018-04-12 06:36:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2018-04-12 06:36:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2127 transitions. [2018-04-12 06:36:37,449 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2127 transitions. Word has length 59 [2018-04-12 06:36:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:37,450 INFO L459 AbstractCegarLoop]: Abstraction has 1681 states and 2127 transitions. [2018-04-12 06:36:37,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:36:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2127 transitions. [2018-04-12 06:36:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 06:36:37,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:37,451 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:36:37,451 INFO L408 AbstractCegarLoop]: === Iteration 44 === [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-12 06:36:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash -129556962, now seen corresponding path program 1 times [2018-04-12 06:36:37,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:37,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:37,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:37,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:36:37,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:37,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:37,483 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:37,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:37,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:37,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:37,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:37,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:36:37,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:36:37,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:37,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:37,525 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-12 06:36:37,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,534 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-12 06:36:37,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-12 06:36:37,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-12 06:36:37,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,565 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-12 06:36:37,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:36:37,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,575 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-12 06:36:37,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 06:36:37,576 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,583 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-12 06:36:37,583 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:39 [2018-04-12 06:36:37,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:37,609 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 56 treesize of output 55 [2018-04-12 06:36:37,616 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-12 06:36:37,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,631 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-12 06:36:37,632 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-12 06:36:37,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,642 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-12 06:36:37,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2018-04-12 06:36:37,684 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:37,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2018-04-12 06:36:37,693 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 24 treesize of output 29 [2018-04-12 06:36:37,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,717 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 61 treesize of output 59 [2018-04-12 06:36:37,719 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 24 treesize of output 29 [2018-04-12 06:36:37,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,735 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-12 06:36:37,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:111, output treesize:95 [2018-04-12 06:36:37,764 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 22 treesize of output 12 [2018-04-12 06:36:37,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,771 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-12 06:36:37,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:59 [2018-04-12 06:36:37,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:37,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-12 06:36:37,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:37,934 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 19 treesize of output 15 [2018-04-12 06:36:37,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,940 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:37,940 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-12 06:36:37,940 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-12 06:36:37,944 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-12 06:36:37,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-12 06:36:37,957 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:37,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-12 06:36:37,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,963 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:37,963 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-12 06:36:37,963 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:37,971 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:98, output treesize:7 [2018-04-12 06:36:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:38,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:38,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 06:36:38,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 06:36:38,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 06:36:38,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=313, Unknown=6, NotChecked=0, Total=380 [2018-04-12 06:36:38,027 INFO L87 Difference]: Start difference. First operand 1681 states and 2127 transitions. Second operand 20 states. [2018-04-12 06:36:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:39,873 INFO L93 Difference]: Finished difference Result 1876 states and 2338 transitions. [2018-04-12 06:36:39,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 06:36:39,874 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-12 06:36:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:39,878 INFO L225 Difference]: With dead ends: 1876 [2018-04-12 06:36:39,878 INFO L226 Difference]: Without dead ends: 1876 [2018-04-12 06:36:39,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=1514, Unknown=22, NotChecked=0, Total=1892 [2018-04-12 06:36:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-04-12 06:36:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1684. [2018-04-12 06:36:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-04-12 06:36:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2130 transitions. [2018-04-12 06:36:39,893 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2130 transitions. Word has length 61 [2018-04-12 06:36:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:39,893 INFO L459 AbstractCegarLoop]: Abstraction has 1684 states and 2130 transitions. [2018-04-12 06:36:39,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 06:36:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2130 transitions. [2018-04-12 06:36:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 06:36:39,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:39,894 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:36:39,894 INFO L408 AbstractCegarLoop]: === Iteration 45 === [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-12 06:36:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash -730653060, now seen corresponding path program 1 times [2018-04-12 06:36:39,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:39,894 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:39,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:39,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:39,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:39,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:39,904 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:39,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:39,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:39,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:39,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:39,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:39,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:39,942 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-12 06:36:39,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 06:36:39,956 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-12 06:36:39,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,964 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-12 06:36:39,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:36:39,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,973 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-12 06:36:39,974 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-12 06:36:39,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:39,979 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-12 06:36:39,980 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2018-04-12 06:36:40,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,005 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 57 treesize of output 54 [2018-04-12 06:36:40,007 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-12 06:36:40,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,024 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 42 treesize of output 46 [2018-04-12 06:36:40,027 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-12 06:36:40,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,039 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-12 06:36:40,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:67 [2018-04-12 06:36:40,073 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 66 treesize of output 59 [2018-04-12 06:36:40,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,075 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 22 treesize of output 35 [2018-04-12 06:36:40,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,097 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 77 treesize of output 63 [2018-04-12 06:36:40,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,099 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 22 treesize of output 35 [2018-04-12 06:36:40,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,124 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-12 06:36:40,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:100 [2018-04-12 06:36:40,316 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 79 treesize of output 58 [2018-04-12 06:36:40,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-12 06:36:40,318 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-12 06:36:40,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,326 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:40,326 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 19 [2018-04-12 06:36:40,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,332 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-12 06:36:40,343 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 52 treesize of output 42 [2018-04-12 06:36:40,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:40,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:40,345 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 19 [2018-04-12 06:36:40,345 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,352 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 21 treesize of output 10 [2018-04-12 06:36:40,352 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:40,360 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:113, output treesize:7 [2018-04-12 06:36:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:40,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:40,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 06:36:40,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:36:40,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:36:40,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-04-12 06:36:40,394 INFO L87 Difference]: Start difference. First operand 1684 states and 2130 transitions. Second operand 17 states. [2018-04-12 06:36:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:41,860 INFO L93 Difference]: Finished difference Result 2150 states and 2681 transitions. [2018-04-12 06:36:41,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 06:36:41,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-04-12 06:36:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:41,863 INFO L225 Difference]: With dead ends: 2150 [2018-04-12 06:36:41,863 INFO L226 Difference]: Without dead ends: 2147 [2018-04-12 06:36:41,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 06:36:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2018-04-12 06:36:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1688. [2018-04-12 06:36:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2018-04-12 06:36:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2134 transitions. [2018-04-12 06:36:41,887 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2134 transitions. Word has length 61 [2018-04-12 06:36:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:41,887 INFO L459 AbstractCegarLoop]: Abstraction has 1688 states and 2134 transitions. [2018-04-12 06:36:41,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:36:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2134 transitions. [2018-04-12 06:36:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 06:36:41,888 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:41,888 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:41,889 INFO L408 AbstractCegarLoop]: === Iteration 46 === [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-12 06:36:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1306228245, now seen corresponding path program 1 times [2018-04-12 06:36:41,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:41,889 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:41,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:41,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:41,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:36:41,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:41,935 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:41,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:36:41,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:36:41,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-04-12 06:36:41,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:36:41,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:36:41,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-12 06:36:41,969 INFO L87 Difference]: Start difference. First operand 1688 states and 2134 transitions. Second operand 9 states. [2018-04-12 06:36:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:42,087 INFO L93 Difference]: Finished difference Result 1748 states and 2195 transitions. [2018-04-12 06:36:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:36:42,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-04-12 06:36:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:42,089 INFO L225 Difference]: With dead ends: 1748 [2018-04-12 06:36:42,089 INFO L226 Difference]: Without dead ends: 1748 [2018-04-12 06:36:42,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-04-12 06:36:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-04-12 06:36:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1688. [2018-04-12 06:36:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2018-04-12 06:36:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2132 transitions. [2018-04-12 06:36:42,098 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2132 transitions. Word has length 63 [2018-04-12 06:36:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:42,098 INFO L459 AbstractCegarLoop]: Abstraction has 1688 states and 2132 transitions. [2018-04-12 06:36:42,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:36:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2132 transitions. [2018-04-12 06:36:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 06:36:42,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:42,099 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:42,099 INFO L408 AbstractCegarLoop]: === Iteration 47 === [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-12 06:36:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 397506269, now seen corresponding path program 2 times [2018-04-12 06:36:42,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:42,100 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:42,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:42,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:42,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:42,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:42,118 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:42,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:42,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:42,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:36:42,140 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:36:42,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:36:42,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:42,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:36:42,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:36:42,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,181 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-12 06:36:42,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-12 06:36:42,192 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-12 06:36:42,193 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-12 06:36:42,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,201 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-12 06:36:42,202 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-12 06:36:42,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,208 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-12 06:36:42,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-12 06:36:42,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,233 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 42 treesize of output 46 [2018-04-12 06:36:42,234 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-12 06:36:42,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,251 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 47 treesize of output 44 [2018-04-12 06:36:42,252 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-12 06:36:42,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,263 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-12 06:36:42,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:67 [2018-04-12 06:36:42,295 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 94 treesize of output 87 [2018-04-12 06:36:42,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,297 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 28 treesize of output 47 [2018-04-12 06:36:42,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,318 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 89 treesize of output 75 [2018-04-12 06:36:42,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,320 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 28 treesize of output 47 [2018-04-12 06:36:42,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,335 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-12 06:36:42,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:103 [2018-04-12 06:36:42,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 88 [2018-04-12 06:36:42,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,585 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-04-12 06:36:42,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:36:42,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-04-12 06:36:42,596 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-12 06:36:42,615 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-12 06:36:42,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 38 [2018-04-12 06:36:42,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 14 [2018-04-12 06:36:42,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:42,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-12 06:36:42,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:42,637 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-12 06:36:42,638 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2018-04-12 06:36:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:42,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:42,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:36:42,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 06:36:42,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 06:36:42,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-04-12 06:36:42,678 INFO L87 Difference]: Start difference. First operand 1688 states and 2132 transitions. Second operand 19 states. [2018-04-12 06:36:43,623 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 96 DAG size of output 65 [2018-04-12 06:36:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:44,517 INFO L93 Difference]: Finished difference Result 2175 states and 2714 transitions. [2018-04-12 06:36:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 06:36:44,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-04-12 06:36:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:44,519 INFO L225 Difference]: With dead ends: 2175 [2018-04-12 06:36:44,519 INFO L226 Difference]: Without dead ends: 2175 [2018-04-12 06:36:44,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 06:36:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2018-04-12 06:36:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1684. [2018-04-12 06:36:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-04-12 06:36:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2128 transitions. [2018-04-12 06:36:44,529 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2128 transitions. Word has length 63 [2018-04-12 06:36:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:44,529 INFO L459 AbstractCegarLoop]: Abstraction has 1684 states and 2128 transitions. [2018-04-12 06:36:44,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 06:36:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2128 transitions. [2018-04-12 06:36:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 06:36:44,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:44,530 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:36:44,530 INFO L408 AbstractCegarLoop]: === Iteration 48 === [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-12 06:36:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 493409295, now seen corresponding path program 1 times [2018-04-12 06:36:44,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:44,530 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:44,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:44,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:36:44,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:44,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:44,553 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:44,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:44,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:44,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:44,588 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-12 06:36:44,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:36:44,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:36:44,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,640 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-12 06:36:44,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,656 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-12 06:36:44,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-12 06:36:44,678 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-12 06:36:44,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 06:36:44,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,690 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-12 06:36:44,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-04-12 06:36:44,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:44,728 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 46 treesize of output 53 [2018-04-12 06:36:44,730 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-12 06:36:44,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,749 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-12 06:36:44,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-12 06:36:44,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:44,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-12 06:36:44,818 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-12 06:36:44,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:44,834 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-12 06:36:44,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:70 [2018-04-12 06:36:50,875 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-04-12 06:36:50,877 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 22 treesize of output 12 [2018-04-12 06:36:50,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:50,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:50,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:45 [2018-04-12 06:36:51,010 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 45 treesize of output 36 [2018-04-12 06:36:51,011 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-12 06:36:51,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:51,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:51,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:51,016 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 24 treesize of output 22 [2018-04-12 06:36:51,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:51,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:51,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:51,026 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:18 [2018-04-12 06:36:51,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:51,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:36:51,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:51,054 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-12 06:36:51,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-12 06:36:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:51,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:51,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 06:36:51,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 06:36:51,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 06:36:51,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=350, Unknown=2, NotChecked=0, Total=420 [2018-04-12 06:36:51,098 INFO L87 Difference]: Start difference. First operand 1684 states and 2128 transitions. Second operand 21 states. [2018-04-12 06:36:53,567 WARN L151 SmtUtils]: Spent 2041ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-04-12 06:36:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:54,832 INFO L93 Difference]: Finished difference Result 1929 states and 2408 transitions. [2018-04-12 06:36:54,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 06:36:54,832 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-04-12 06:36:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:54,834 INFO L225 Difference]: With dead ends: 1929 [2018-04-12 06:36:54,834 INFO L226 Difference]: Without dead ends: 1929 [2018-04-12 06:36:54,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=337, Invalid=1641, Unknown=2, NotChecked=0, Total=1980 [2018-04-12 06:36:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-04-12 06:36:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1699. [2018-04-12 06:36:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2018-04-12 06:36:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2144 transitions. [2018-04-12 06:36:54,844 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2144 transitions. Word has length 66 [2018-04-12 06:36:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:54,844 INFO L459 AbstractCegarLoop]: Abstraction has 1699 states and 2144 transitions. [2018-04-12 06:36:54,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 06:36:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2144 transitions. [2018-04-12 06:36:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 06:36:54,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:54,845 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:54,845 INFO L408 AbstractCegarLoop]: === Iteration 49 === [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-12 06:36:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1688668822, now seen corresponding path program 1 times [2018-04-12 06:36:54,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:54,845 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:54,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:54,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:54,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:54,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:54,860 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:54,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:54,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:54,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:54,899 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-12 06:36:54,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:54,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:54,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:36:54,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:54,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:54,918 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-12 06:36:54,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:54,925 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-12 06:36:54,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:54,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:54,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:34 [2018-04-12 06:36:54,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:54,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:54,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:54,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 37 [2018-04-12 06:36:54,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:54,982 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 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-12 06:36:54,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:54,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:54,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2018-04-12 06:36:55,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 06:36:55,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,033 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-12 06:36:55,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, 2 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-12 06:36:55,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,047 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-12 06:36:55,049 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-12 06:36:55,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:55,060 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:64 [2018-04-12 06:36:55,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:55,114 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 78 treesize of output 75 [2018-04-12 06:36:55,116 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-12 06:36:55,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-04-12 06:36:55,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:36:55,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,164 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-12 06:36:55,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:122, output treesize:102 [2018-04-12 06:36:55,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 106 [2018-04-12 06:36:55,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:55,239 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 28 treesize of output 47 [2018-04-12 06:36:55,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 84 treesize of output 77 [2018-04-12 06:36:55,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:55,274 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 28 treesize of output 47 [2018-04-12 06:36:55,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,298 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-12 06:36:55,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:138 [2018-04-12 06:36:55,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-12 06:36:55,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:55,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:106 [2018-04-12 06:36:55,504 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 121 treesize of output 96 [2018-04-12 06:36:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2018-04-12 06:36:55,506 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-12 06:36:55,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:55,515 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 32 treesize of output 16 [2018-04-12 06:36:55,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,521 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-12 06:36:55,532 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 56 treesize of output 46 [2018-04-12 06:36:55,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:55,534 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 28 treesize of output 14 [2018-04-12 06:36:55,535 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,539 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-12 06:36:55,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:55,546 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-12 06:36:55,546 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:148, output treesize:7 [2018-04-12 06:36:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:36:55,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:36:55,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:36:55,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 06:36:55,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 06:36:55,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=286, Unknown=1, NotChecked=0, Total=342 [2018-04-12 06:36:55,607 INFO L87 Difference]: Start difference. First operand 1699 states and 2144 transitions. Second operand 19 states. [2018-04-12 06:36:58,183 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 129 DAG size of output 78 [2018-04-12 06:36:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:36:59,404 INFO L93 Difference]: Finished difference Result 2523 states and 3142 transitions. [2018-04-12 06:36:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 06:36:59,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-04-12 06:36:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:36:59,406 INFO L225 Difference]: With dead ends: 2523 [2018-04-12 06:36:59,406 INFO L226 Difference]: Without dead ends: 2523 [2018-04-12 06:36:59,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=605, Invalid=2147, Unknown=4, NotChecked=0, Total=2756 [2018-04-12 06:36:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-04-12 06:36:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 1928. [2018-04-12 06:36:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-04-12 06:36:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2437 transitions. [2018-04-12 06:36:59,427 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2437 transitions. Word has length 66 [2018-04-12 06:36:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:36:59,427 INFO L459 AbstractCegarLoop]: Abstraction has 1928 states and 2437 transitions. [2018-04-12 06:36:59,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 06:36:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2437 transitions. [2018-04-12 06:36:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 06:36:59,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:36:59,428 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:36:59,428 INFO L408 AbstractCegarLoop]: === Iteration 50 === [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-12 06:36:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1645242588, now seen corresponding path program 1 times [2018-04-12 06:36:59,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:36:59,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:36:59,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:59,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:59,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:36:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:59,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:36:59,442 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:36:59,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:36:59,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:36:59,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:36:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:36:59,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:36:59,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,516 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-12 06:36:59,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-12 06:36:59,539 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-12 06:36:59,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, 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-12 06:36:59,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,553 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-12 06:36:59,555 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-12 06:36:59,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,565 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-12 06:36:59,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2018-04-12 06:36:59,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,597 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 56 treesize of output 63 [2018-04-12 06:36:59,598 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-12 06:36:59,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,619 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 34 treesize of output 38 [2018-04-12 06:36:59,620 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-12 06:36:59,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,634 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-12 06:36:59,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2018-04-12 06:36:59,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:59,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-04-12 06:36:59,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,695 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 20 treesize of output 31 [2018-04-12 06:36:59,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,721 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:36:59,727 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 75 [2018-04-12 06:36:59,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,729 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 20 treesize of output 31 [2018-04-12 06:36:59,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,752 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-12 06:36:59,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:107 [2018-04-12 06:36:59,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-04-12 06:36:59,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:59,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:127 [2018-04-12 06:36:59,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-12 06:36:59,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,912 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 59 treesize of output 61 [2018-04-12 06:36:59,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 40 [2018-04-12 06:36:59,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,966 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 78 treesize of output 73 [2018-04-12 06:36:59,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:36:59,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-04-12 06:36:59,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:36:59,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:36:59,998 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:158, output treesize:126 [2018-04-12 06:37:00,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:00,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:00,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2018-04-12 06:37:00,079 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-12 06:37:00,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:00,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:00,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2018-04-12 06:37:00,131 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-12 06:37:00,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,175 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-12 06:37:00,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:164 [2018-04-12 06:37:00,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 126 [2018-04-12 06:37:00,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:00,321 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 22 treesize of output 35 [2018-04-12 06:37:00,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 132 [2018-04-12 06:37:00,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:00,382 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 22 treesize of output 35 [2018-04-12 06:37:00,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:00,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:00,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:217, output treesize:197 [2018-04-12 06:37:00,841 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 70 DAG size of output 70 [2018-04-12 06:37:01,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2018-04-12 06:37:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,084 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2018-04-12 06:37:01,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:37:01,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,106 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:01,106 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 19 [2018-04-12 06:37:01,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:01,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 62 [2018-04-12 06:37:01,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:01,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:01,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-04-12 06:37:01,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,168 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:01,168 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 19 [2018-04-12 06:37:01,168 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:01,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,185 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 13 treesize of output 6 [2018-04-12 06:37:01,185 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:01,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:01,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:01,196 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 37 treesize of output 19 [2018-04-12 06:37:01,196 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:01,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:01,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:01,212 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:219, output treesize:7 [2018-04-12 06:37:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:37:01,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:01,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 06:37:01,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 06:37:01,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 06:37:01,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-04-12 06:37:01,284 INFO L87 Difference]: Start difference. First operand 1928 states and 2437 transitions. Second operand 27 states. [2018-04-12 06:37:02,082 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 66 DAG size of output 64 [2018-04-12 06:37:02,825 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 110 DAG size of output 94 [2018-04-12 06:37:03,540 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 179 DAG size of output 107 [2018-04-12 06:37:03,809 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 177 DAG size of output 105 [2018-04-12 06:37:04,238 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 181 DAG size of output 109 [2018-04-12 06:37:08,410 WARN L151 SmtUtils]: Spent 4066ms on a formula simplification. DAG size of input: 135 DAG size of output 82 [2018-04-12 06:37:08,751 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 188 DAG size of output 116 [2018-04-12 06:37:09,059 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 188 DAG size of output 108 [2018-04-12 06:37:09,434 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 190 DAG size of output 112 [2018-04-12 06:37:09,972 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 183 DAG size of output 107 [2018-04-12 06:37:10,195 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 175 DAG size of output 103 [2018-04-12 06:37:10,551 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 181 DAG size of output 122 [2018-04-12 06:37:11,943 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 143 DAG size of output 90 [2018-04-12 06:37:12,206 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 150 DAG size of output 97 [2018-04-12 06:37:12,418 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 150 DAG size of output 89 [2018-04-12 06:37:12,654 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 152 DAG size of output 94 [2018-04-12 06:37:12,861 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 145 DAG size of output 88 [2018-04-12 06:37:13,216 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 143 DAG size of output 103 [2018-04-12 06:37:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:37:13,498 INFO L93 Difference]: Finished difference Result 2123 states and 2628 transitions. [2018-04-12 06:37:13,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 06:37:13,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-04-12 06:37:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:37:13,500 INFO L225 Difference]: With dead ends: 2123 [2018-04-12 06:37:13,500 INFO L226 Difference]: Without dead ends: 2123 [2018-04-12 06:37:13,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1057, Invalid=4055, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 06:37:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2018-04-12 06:37:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1835. [2018-04-12 06:37:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-04-12 06:37:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2290 transitions. [2018-04-12 06:37:13,512 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2290 transitions. Word has length 66 [2018-04-12 06:37:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:37:13,512 INFO L459 AbstractCegarLoop]: Abstraction has 1835 states and 2290 transitions. [2018-04-12 06:37:13,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 06:37:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2290 transitions. [2018-04-12 06:37:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 06:37:13,512 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:37:13,512 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:37:13,513 INFO L408 AbstractCegarLoop]: === Iteration 51 === [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-12 06:37:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1970404721, now seen corresponding path program 2 times [2018-04-12 06:37:13,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:37:13,513 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:37:13,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:13,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:37:13,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:37:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:37:13,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:37:13,524 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:37:13,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:37:13,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:37:13,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:37:13,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:37:13,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:37:13,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:37:13,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,570 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-12 06:37:13,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 06:37:13,597 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-12 06:37:13,598 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-12 06:37:13,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,628 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-12 06:37:13,630 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-12 06:37:13,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,655 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-12 06:37:13,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2018-04-12 06:37:13,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,698 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 56 treesize of output 63 [2018-04-12 06:37:13,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 06:37:13,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,725 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 34 treesize of output 38 [2018-04-12 06:37:13,726 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-12 06:37:13,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,743 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-12 06:37:13,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:71 [2018-04-12 06:37:13,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:13,799 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 82 treesize of output 83 [2018-04-12 06:37:13,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,801 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 20 treesize of output 31 [2018-04-12 06:37:13,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,831 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 54 treesize of output 52 [2018-04-12 06:37:13,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,833 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 20 treesize of output 31 [2018-04-12 06:37:13,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,853 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-12 06:37:13,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:104 [2018-04-12 06:37:13,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:13,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-12 06:37:13,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:13,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:13,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:115, output treesize:121 [2018-04-12 06:37:13,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-12 06:37:13,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:14,022 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 78 treesize of output 73 [2018-04-12 06:37:14,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:14,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-04-12 06:37:14,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-04-12 06:37:14,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:14,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 40 [2018-04-12 06:37:14,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:14,087 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:152, output treesize:114 [2018-04-12 06:37:14,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:14,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:14,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 123 [2018-04-12 06:37:14,185 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-12 06:37:14,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 92 [2018-04-12 06:37:14,231 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-12 06:37:14,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,257 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-12 06:37:14,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:160, output treesize:140 [2018-04-12 06:37:14,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 142 [2018-04-12 06:37:14,375 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-12 06:37:14,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 99 [2018-04-12 06:37:14,416 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-12 06:37:14,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:14,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:14,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:184, output treesize:164 [2018-04-12 06:37:20,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 103 [2018-04-12 06:37:20,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:20,672 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:20,672 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 22 treesize of output 32 [2018-04-12 06:37:20,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-04-12 06:37:20,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:20,692 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-12 06:37:20,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:37:20,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-04-12 06:37:20,712 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-12 06:37:20,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:37:20,721 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:37:20,721 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 20 treesize of output 24 [2018-04-12 06:37:20,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,727 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 26 treesize of output 13 [2018-04-12 06:37:20,727 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:37:20,736 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:157, output treesize:10 [2018-04-12 06:37:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:37:20,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:37:20,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 06:37:20,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 06:37:20,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 06:37:20,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=375, Unknown=3, NotChecked=0, Total=462 [2018-04-12 06:37:20,787 INFO L87 Difference]: Start difference. First operand 1835 states and 2290 transitions. Second operand 22 states. [2018-04-12 06:37:38,108 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 96 DAG size of output 80 [2018-04-12 06:37:48,413 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 157 DAG size of output 84 [2018-04-12 06:38:06,896 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 109 DAG size of output 62 [2018-04-12 06:38:13,285 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 119 DAG size of output 81 [2018-04-12 06:38:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:38:20,131 INFO L93 Difference]: Finished difference Result 2087 states and 2574 transitions. [2018-04-12 06:38:20,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 06:38:20,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-04-12 06:38:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:38:20,132 INFO L225 Difference]: With dead ends: 2087 [2018-04-12 06:38:20,132 INFO L226 Difference]: Without dead ends: 2083 [2018-04-12 06:38:20,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=498, Invalid=1733, Unknown=25, NotChecked=0, Total=2256 [2018-04-12 06:38:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2018-04-12 06:38:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1849. [2018-04-12 06:38:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2018-04-12 06:38:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2307 transitions. [2018-04-12 06:38:20,149 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2307 transitions. Word has length 67 [2018-04-12 06:38:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:38:20,149 INFO L459 AbstractCegarLoop]: Abstraction has 1849 states and 2307 transitions. [2018-04-12 06:38:20,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 06:38:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2307 transitions. [2018-04-12 06:38:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-12 06:38:20,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:38:20,150 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:38:20,151 INFO L408 AbstractCegarLoop]: === Iteration 52 === [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-12 06:38:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2136794448, now seen corresponding path program 1 times [2018-04-12 06:38:20,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:38:20,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:38:20,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:38:20,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:38:20,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:38:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:38:20,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:38:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:38:20,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:38:20,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:38:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:38:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:38:20,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:38:20,311 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-12 06:38:20,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,315 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-12 06:38:20,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:38:20,517 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-12 06:38:20,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:20,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:20,526 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-12 06:38:20,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2018-04-12 06:38:20,550 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 28 treesize of output 21 [2018-04-12 06:38:20,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:20,552 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 21 treesize of output 30 [2018-04-12 06:38:20,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,564 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-12 06:38:20,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-04-12 06:38:20,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:20,622 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 48 treesize of output 55 [2018-04-12 06:38:20,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 06:38:20,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,635 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-12 06:38:20,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:58 [2018-04-12 06:38:20,721 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 63 treesize of output 49 [2018-04-12 06:38:20,723 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-12 06:38:20,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:20,736 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-12 06:38:20,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:70 [2018-04-12 06:38:24,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 43 [2018-04-12 06:38:24,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:24,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:24,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:38:24,954 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 24 treesize of output 26 [2018-04-12 06:38:24,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:24,962 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-12 06:38:24,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:24,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:24,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:38:24,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:16 [2018-04-12 06:38:25,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:25,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:38:25,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 06:38:25,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:38:25,028 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-12 06:38:25,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-04-12 06:38:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:38:25,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:38:25,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 33 [2018-04-12 06:38:25,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 06:38:25,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 06:38:25,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=949, Unknown=3, NotChecked=0, Total=1056 [2018-04-12 06:38:25,109 INFO L87 Difference]: Start difference. First operand 1849 states and 2307 transitions. Second operand 33 states. [2018-04-12 06:38:54,413 WARN L151 SmtUtils]: Spent 4041ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-04-12 06:39:34,870 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 53 DAG size of output 50 Received shutdown request... [2018-04-12 06:40:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 06:40:35,560 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 06:40:35,563 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 06:40:35,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:40:35 BoogieIcfgContainer [2018-04-12 06:40:35,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 06:40:35,564 INFO L168 Benchmark]: Toolchain (without parser) took 852564.44 ms. Allocated memory was 351.8 MB in the beginning and 450.9 MB in the end (delta: 99.1 MB). Free memory was 294.7 MB in the beginning and 279.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 114.7 MB. Max. memory is 5.3 GB. [2018-04-12 06:40:35,565 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 351.8 MB. Free memory is still 320.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 06:40:35,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.69 ms. Allocated memory is still 351.8 MB. Free memory was 294.0 MB in the beginning and 268.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-12 06:40:35,565 INFO L168 Benchmark]: Boogie Preprocessor took 47.20 ms. Allocated memory is still 351.8 MB. Free memory was 268.8 MB in the beginning and 266.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-12 06:40:35,565 INFO L168 Benchmark]: RCFGBuilder took 476.95 ms. Allocated memory was 351.8 MB in the beginning and 469.8 MB in the end (delta: 118.0 MB). Free memory was 266.2 MB in the beginning and 389.2 MB in the end (delta: -123.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 5.3 GB. [2018-04-12 06:40:35,565 INFO L168 Benchmark]: TraceAbstraction took 851790.71 ms. Allocated memory was 469.8 MB in the beginning and 450.9 MB in the end (delta: -18.9 MB). Free memory was 388.0 MB in the beginning and 279.1 MB in the end (delta: 109.0 MB). Peak memory consumption was 90.1 MB. Max. memory is 5.3 GB. [2018-04-12 06:40:35,566 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 351.8 MB. Free memory is still 320.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 246.69 ms. Allocated memory is still 351.8 MB. Free memory was 294.0 MB in the beginning and 268.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.20 ms. Allocated memory is still 351.8 MB. Free memory was 268.8 MB in the beginning and 266.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 476.95 ms. Allocated memory was 351.8 MB in the beginning and 469.8 MB in the end (delta: 118.0 MB). Free memory was 266.2 MB in the beginning and 389.2 MB in the end (delta: -123.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 851790.71 ms. Allocated memory was 469.8 MB in the beginning and 450.9 MB in the end (delta: -18.9 MB). Free memory was 388.0 MB in the beginning and 279.1 MB in the end (delta: 109.0 MB). Peak memory consumption was 90.1 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 constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 65 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (1261 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 55 error locations. TIMEOUT Result, 851.7s OverallTime, 52 OverallIterations, 4 TraceHistogramMax, 706.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5848 SDtfs, 26318 SDslu, 31641 SDs, 0 SdLazy, 33230 SolverSat, 2333 SolverUnsat, 252 SolverUnknown, 0 SolverNotchecked, 204.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2629 GetRequests, 1353 SyntacticMatches, 16 SemanticMatches, 1260 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11415 ImplicationChecksByTransitivity, 610.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1928occurred in iteration=49, 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.3s AutomataMinimizationTime, 51 MinimizatonAttempts, 8324 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 143.8s InterpolantComputationTime, 4007 NumberOfCodeBlocks, 4007 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2451 ConstructedInterpolants, 649 QuantifiedInterpolants, 4267774 SizeOfPredicates, 561 NumberOfNonLiveVariables, 7263 ConjunctsInSsa, 1266 ConjunctsInUnsatCore, 57 InterpolantComputations, 25 PerfectInterpolantSequences, 209/410 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-12_06-40-35-571.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-12_06-40-35-571.csv Completed graceful shutdown