java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 21:33:48,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:33:48,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:33:48,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:33:48,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:33:48,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:33:48,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:33:48,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:33:48,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:33:48,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:33:48,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:33:48,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:33:48,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:33:49,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:33:49,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:33:49,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:33:49,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:33:49,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:33:49,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:33:49,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:33:49,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:33:49,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:33:49,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:33:49,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:33:49,011 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:33:49,012 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:33:49,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:33:49,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:33:49,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:33:49,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:33:49,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:33:49,014 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 21:33:49,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:33:49,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:33:49,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 21:33:49,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 21:33:49,038 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 21:33:49,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:33:49,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:33:49,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:33:49,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:33:49,038 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:33:49,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:33:49,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 21:33:49,039 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:33:49,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:33:49,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:33:49,040 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:33:49,040 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:33:49,040 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 21:33:49,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:33:49,078 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:33:49,081 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:33:49,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:33:49,085 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:33:49,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,379 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6f8b6284d [2018-04-11 21:33:49,553 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:33:49,553 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:33:49,554 INFO L168 CDTParser]: Scanning tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,560 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:33:49,560 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:33:49,560 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:33:49,560 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ushort in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,562 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____useconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__wchar_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,563 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____swblk_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__register_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,564 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uint in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__size_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____intptr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____socklen_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____qaddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__lldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__div_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_set in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ulong in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:49,610 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6f8b6284d [2018-04-11 21:33:49,613 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:33:49,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:33:49,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:33:49,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:33:49,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:33:49,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cf35de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49, skipping insertion in model container [2018-04-11 21:33:49,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,633 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:33:49,655 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:33:49,778 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:33:49,816 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:33:49,822 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 21:33:49,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49 WrapperNode [2018-04-11 21:33:49,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:33:49,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:33:49,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:33:49,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:33:49,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... [2018-04-11 21:33:49,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:33:49,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:33:49,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:33:49,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:33:49,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:33:49,983 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:33:49,984 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:33:49,984 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:33:49,984 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:33:49,985 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:33:49,986 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:33:49,987 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:33:49,988 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:33:49,989 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:33:49,990 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:33:49,990 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:33:49,990 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:33:49,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:33:49,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:33:49,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:33:50,336 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:33:50,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:33:50 BoogieIcfgContainer [2018-04-11 21:33:50,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:33:50,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:33:50,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:33:50,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:33:50,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:33:49" (1/3) ... [2018-04-11 21:33:50,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7988ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:33:50, skipping insertion in model container [2018-04-11 21:33:50,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:33:49" (2/3) ... [2018-04-11 21:33:50,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7988ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:33:50, skipping insertion in model container [2018-04-11 21:33:50,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:33:50" (3/3) ... [2018-04-11 21:33:50,342 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-11 21:33:50,347 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:33:50,359 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-11 21:33:50,384 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:33:50,384 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:33:50,385 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 21:33:50,385 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:33:50,385 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:33:50,385 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:33:50,385 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:33:50,385 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:33:50,385 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:33:50,385 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:33:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2018-04-11 21:33:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 21:33:50,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:50,405 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:50,405 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash 534396452, now seen corresponding path program 1 times [2018-04-11 21:33:50,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:50,410 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:50,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:50,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:50,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:50,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:50,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:50,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:33:50,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:33:50,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:33:50,527 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2018-04-11 21:33:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:50,740 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2018-04-11 21:33:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:33:50,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 21:33:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:50,751 INFO L225 Difference]: With dead ends: 180 [2018-04-11 21:33:50,751 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 21:33:50,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 21:33:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2018-04-11 21:33:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 21:33:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-04-11 21:33:50,790 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 8 [2018-04-11 21:33:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:50,790 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-04-11 21:33:50,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:33:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-04-11 21:33:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 21:33:50,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:50,791 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:50,791 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 534396453, now seen corresponding path program 1 times [2018-04-11 21:33:50,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:50,791 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:50,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:50,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:50,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:50,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:50,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:50,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:33:50,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:33:50,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:33:50,841 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 4 states. [2018-04-11 21:33:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:50,963 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-04-11 21:33:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:33:50,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 21:33:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:50,966 INFO L225 Difference]: With dead ends: 169 [2018-04-11 21:33:50,966 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 21:33:50,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 21:33:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2018-04-11 21:33:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 21:33:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-04-11 21:33:50,975 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-04-11 21:33:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:50,975 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-04-11 21:33:50,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:33:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-04-11 21:33:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 21:33:50,976 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:50,976 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:50,976 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612785, now seen corresponding path program 1 times [2018-04-11 21:33:50,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:50,976 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:50,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:50,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:50,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:50,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:51,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:33:51,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:33:51,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:33:51,014 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-04-11 21:33:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,139 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-04-11 21:33:51,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:33:51,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 21:33:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,141 INFO L225 Difference]: With dead ends: 158 [2018-04-11 21:33:51,141 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 21:33:51,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 21:33:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2018-04-11 21:33:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 21:33:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-04-11 21:33:51,146 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-04-11 21:33:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,147 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-04-11 21:33:51,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:33:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-04-11 21:33:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 21:33:51,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,147 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,147 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612786, now seen corresponding path program 1 times [2018-04-11 21:33:51,148 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,148 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:33:51,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:33:51,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:33:51,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:51,195 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 5 states. [2018-04-11 21:33:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,374 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2018-04-11 21:33:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:33:51,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 21:33:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,376 INFO L225 Difference]: With dead ends: 241 [2018-04-11 21:33:51,376 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 21:33:51,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:33:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 21:33:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 186. [2018-04-11 21:33:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 21:33:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 244 transitions. [2018-04-11 21:33:51,385 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 244 transitions. Word has length 14 [2018-04-11 21:33:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,386 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 244 transitions. [2018-04-11 21:33:51,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:33:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 244 transitions. [2018-04-11 21:33:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 21:33:51,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,386 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,387 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash -655644961, now seen corresponding path program 1 times [2018-04-11 21:33:51,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,387 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:33:51,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:33:51,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:33:51,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:33:51,420 INFO L87 Difference]: Start difference. First operand 186 states and 244 transitions. Second operand 4 states. [2018-04-11 21:33:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,429 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-04-11 21:33:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:33:51,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 21:33:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,431 INFO L225 Difference]: With dead ends: 199 [2018-04-11 21:33:51,431 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 21:33:51,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 21:33:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2018-04-11 21:33:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 21:33:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2018-04-11 21:33:51,435 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 17 [2018-04-11 21:33:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,435 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2018-04-11 21:33:51,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:33:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2018-04-11 21:33:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:33:51,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,436 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,436 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1393122237, now seen corresponding path program 1 times [2018-04-11 21:33:51,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,436 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:51,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:33:51,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:33:51,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:51,467 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 3 states. [2018-04-11 21:33:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,476 INFO L93 Difference]: Finished difference Result 189 states and 245 transitions. [2018-04-11 21:33:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:33:51,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-11 21:33:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,478 INFO L225 Difference]: With dead ends: 189 [2018-04-11 21:33:51,478 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 21:33:51,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 21:33:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-11 21:33:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 21:33:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2018-04-11 21:33:51,484 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 22 [2018-04-11 21:33:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,484 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2018-04-11 21:33:51,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:33:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2018-04-11 21:33:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:33:51,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,485 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,485 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 145884264, now seen corresponding path program 1 times [2018-04-11 21:33:51,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:51,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:33:51,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:33:51,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:51,512 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 3 states. [2018-04-11 21:33:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,522 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2018-04-11 21:33:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:33:51,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-11 21:33:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,524 INFO L225 Difference]: With dead ends: 191 [2018-04-11 21:33:51,524 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 21:33:51,524 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 21:33:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-04-11 21:33:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 21:33:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2018-04-11 21:33:51,531 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 22 [2018-04-11 21:33:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,531 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2018-04-11 21:33:51,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:33:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2018-04-11 21:33:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 21:33:51,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,532 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,532 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1289236446, now seen corresponding path program 1 times [2018-04-11 21:33:51,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,533 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:51,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:33:51,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:33:51,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:51,585 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2018-04-11 21:33:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,595 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2018-04-11 21:33:51,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:33:51,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-11 21:33:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,596 INFO L225 Difference]: With dead ends: 207 [2018-04-11 21:33:51,596 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 21:33:51,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 21:33:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-11 21:33:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 21:33:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2018-04-11 21:33:51,601 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 24 [2018-04-11 21:33:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,602 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2018-04-11 21:33:51,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:33:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-04-11 21:33:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 21:33:51,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,602 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,602 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 527848965, now seen corresponding path program 1 times [2018-04-11 21:33:51,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,603 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:51,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:33:51,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:33:51,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:33:51,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:33:51,725 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 6 states. [2018-04-11 21:33:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:51,894 INFO L93 Difference]: Finished difference Result 298 states and 366 transitions. [2018-04-11 21:33:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:33:51,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 21:33:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:51,895 INFO L225 Difference]: With dead ends: 298 [2018-04-11 21:33:51,895 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 21:33:51,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 21:33:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 210. [2018-04-11 21:33:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 21:33:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2018-04-11 21:33:51,898 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 24 [2018-04-11 21:33:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:51,898 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2018-04-11 21:33:51,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:33:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2018-04-11 21:33:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 21:33:51,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:51,899 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:51,899 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:51,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221121, now seen corresponding path program 1 times [2018-04-11 21:33:51,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:51,899 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:51,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:51,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:51,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:51,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-11 21:33:51,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:51,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:33:51,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:33:51,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:33:51,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:51,934 INFO L87 Difference]: Start difference. First operand 210 states and 268 transitions. Second operand 5 states. [2018-04-11 21:33:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:52,079 INFO L93 Difference]: Finished difference Result 337 states and 420 transitions. [2018-04-11 21:33:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:33:52,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 21:33:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:52,080 INFO L225 Difference]: With dead ends: 337 [2018-04-11 21:33:52,080 INFO L226 Difference]: Without dead ends: 337 [2018-04-11 21:33:52,080 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:33:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-11 21:33:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 209. [2018-04-11 21:33:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-11 21:33:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 266 transitions. [2018-04-11 21:33:52,083 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 266 transitions. Word has length 25 [2018-04-11 21:33:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:52,083 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 266 transitions. [2018-04-11 21:33:52,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:33:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 266 transitions. [2018-04-11 21:33:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 21:33:52,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:52,083 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:52,084 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221120, now seen corresponding path program 1 times [2018-04-11 21:33:52,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:52,084 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:52,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:52,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:52,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:52,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:52,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:33:52,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:33:52,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:33:52,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:52,173 INFO L87 Difference]: Start difference. First operand 209 states and 266 transitions. Second operand 5 states. [2018-04-11 21:33:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:52,338 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2018-04-11 21:33:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:33:52,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 21:33:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:52,340 INFO L225 Difference]: With dead ends: 372 [2018-04-11 21:33:52,340 INFO L226 Difference]: Without dead ends: 372 [2018-04-11 21:33:52,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:33:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-11 21:33:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 208. [2018-04-11 21:33:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-11 21:33:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 264 transitions. [2018-04-11 21:33:52,345 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 264 transitions. Word has length 25 [2018-04-11 21:33:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:52,345 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 264 transitions. [2018-04-11 21:33:52,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:33:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 264 transitions. [2018-04-11 21:33:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 21:33:52,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:52,346 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:52,346 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1869347276, now seen corresponding path program 1 times [2018-04-11 21:33:52,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:52,346 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:52,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:52,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:52,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:52,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:52,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:33:52,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:33:52,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:33:52,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:33:52,411 INFO L87 Difference]: Start difference. First operand 208 states and 264 transitions. Second operand 6 states. [2018-04-11 21:33:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:52,540 INFO L93 Difference]: Finished difference Result 221 states and 279 transitions. [2018-04-11 21:33:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:33:52,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 21:33:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:52,541 INFO L225 Difference]: With dead ends: 221 [2018-04-11 21:33:52,541 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 21:33:52,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 21:33:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2018-04-11 21:33:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 21:33:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2018-04-11 21:33:52,546 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 26 [2018-04-11 21:33:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:52,546 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2018-04-11 21:33:52,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:33:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2018-04-11 21:33:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 21:33:52,547 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:52,547 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:52,547 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:52,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1875072914, now seen corresponding path program 1 times [2018-04-11 21:33:52,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:52,548 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:52,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:52,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:52,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:52,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:52,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:33:52,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:33:52,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:33:52,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:33:52,613 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand 6 states. [2018-04-11 21:33:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:52,807 INFO L93 Difference]: Finished difference Result 303 states and 371 transitions. [2018-04-11 21:33:52,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:33:52,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 21:33:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:52,808 INFO L225 Difference]: With dead ends: 303 [2018-04-11 21:33:52,809 INFO L226 Difference]: Without dead ends: 303 [2018-04-11 21:33:52,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:33:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-11 21:33:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2018-04-11 21:33:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-11 21:33:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 336 transitions. [2018-04-11 21:33:52,814 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 336 transitions. Word has length 26 [2018-04-11 21:33:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:52,814 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 336 transitions. [2018-04-11 21:33:52,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:33:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 336 transitions. [2018-04-11 21:33:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 21:33:52,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:52,815 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:52,815 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash 121654351, now seen corresponding path program 1 times [2018-04-11 21:33:52,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:52,815 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:52,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:52,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:52,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:52,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:52,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:33:52,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:33:52,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:33:52,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:33:52,869 INFO L87 Difference]: Start difference. First operand 256 states and 336 transitions. Second operand 6 states. [2018-04-11 21:33:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:53,041 INFO L93 Difference]: Finished difference Result 259 states and 321 transitions. [2018-04-11 21:33:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:33:53,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 21:33:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:53,043 INFO L225 Difference]: With dead ends: 259 [2018-04-11 21:33:53,043 INFO L226 Difference]: Without dead ends: 259 [2018-04-11 21:33:53,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-11 21:33:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 224. [2018-04-11 21:33:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 21:33:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2018-04-11 21:33:53,047 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 28 [2018-04-11 21:33:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:53,048 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2018-04-11 21:33:53,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:33:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2018-04-11 21:33:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 21:33:53,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:53,048 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:53,048 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash 398243291, now seen corresponding path program 1 times [2018-04-11 21:33:53,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:53,049 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:53,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:53,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:53,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:53,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:53,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:53,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:33:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:33:53,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:33:53,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:53,135 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 9 states. [2018-04-11 21:33:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:53,515 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-04-11 21:33:53,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:33:53,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 21:33:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:53,516 INFO L225 Difference]: With dead ends: 311 [2018-04-11 21:33:53,516 INFO L226 Difference]: Without dead ends: 311 [2018-04-11 21:33:53,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 21:33:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-11 21:33:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 223. [2018-04-11 21:33:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 21:33:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 280 transitions. [2018-04-11 21:33:53,520 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 280 transitions. Word has length 28 [2018-04-11 21:33:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:53,520 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 280 transitions. [2018-04-11 21:33:53,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:33:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 280 transitions. [2018-04-11 21:33:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 21:33:53,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:53,521 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:53,521 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:53,521 INFO L82 PathProgramCache]: Analyzing trace with hash 398243292, now seen corresponding path program 1 times [2018-04-11 21:33:53,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:53,521 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:53,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:53,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:53,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:53,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:53,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:53,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:33:53,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:33:53,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:33:53,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:53,593 INFO L87 Difference]: Start difference. First operand 223 states and 280 transitions. Second operand 9 states. [2018-04-11 21:33:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:54,053 INFO L93 Difference]: Finished difference Result 310 states and 383 transitions. [2018-04-11 21:33:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:33:54,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 21:33:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:54,054 INFO L225 Difference]: With dead ends: 310 [2018-04-11 21:33:54,054 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 21:33:54,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 21:33:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 21:33:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 222. [2018-04-11 21:33:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 21:33:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 278 transitions. [2018-04-11 21:33:54,059 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 278 transitions. Word has length 28 [2018-04-11 21:33:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:54,059 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 278 transitions. [2018-04-11 21:33:54,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:33:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 278 transitions. [2018-04-11 21:33:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:33:54,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:54,060 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:54,060 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash -468463012, now seen corresponding path program 1 times [2018-04-11 21:33:54,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:54,060 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:54,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:54,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:54,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:54,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:54,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:54,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:33:54,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:33:54,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:33:54,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:54,091 INFO L87 Difference]: Start difference. First operand 222 states and 278 transitions. Second operand 5 states. [2018-04-11 21:33:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:54,274 INFO L93 Difference]: Finished difference Result 351 states and 431 transitions. [2018-04-11 21:33:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:33:54,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 21:33:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:54,275 INFO L225 Difference]: With dead ends: 351 [2018-04-11 21:33:54,276 INFO L226 Difference]: Without dead ends: 351 [2018-04-11 21:33:54,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:33:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-11 21:33:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 221. [2018-04-11 21:33:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 21:33:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 276 transitions. [2018-04-11 21:33:54,280 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 276 transitions. Word has length 29 [2018-04-11 21:33:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:54,280 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 276 transitions. [2018-04-11 21:33:54,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:33:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 276 transitions. [2018-04-11 21:33:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 21:33:54,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:54,280 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:54,281 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash -468463011, now seen corresponding path program 1 times [2018-04-11 21:33:54,281 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:54,281 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:54,282 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:54,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:54,282 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:54,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:54,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:54,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:33:54,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:33:54,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:33:54,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:33:54,324 INFO L87 Difference]: Start difference. First operand 221 states and 276 transitions. Second operand 5 states. [2018-04-11 21:33:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:54,543 INFO L93 Difference]: Finished difference Result 388 states and 491 transitions. [2018-04-11 21:33:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:33:54,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 21:33:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:54,545 INFO L225 Difference]: With dead ends: 388 [2018-04-11 21:33:54,545 INFO L226 Difference]: Without dead ends: 388 [2018-04-11 21:33:54,545 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:33:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-11 21:33:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 220. [2018-04-11 21:33:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 21:33:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2018-04-11 21:33:54,549 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 29 [2018-04-11 21:33:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:54,550 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2018-04-11 21:33:54,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:33:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2018-04-11 21:33:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 21:33:54,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:54,550 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:54,550 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2092835834, now seen corresponding path program 1 times [2018-04-11 21:33:54,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:54,551 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:54,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:54,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:54,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:54,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:54,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:33:54,617 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:33:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:54,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:33:54,716 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~0.base Int)) (and (= (store |c_old(#valid)| main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0))) is different from true [2018-04-11 21:33:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 21:33:54,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:33:54,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-04-11 21:33:54,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:33:54,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:33:54,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-04-11 21:33:54,755 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 10 states. [2018-04-11 21:33:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:55,044 INFO L93 Difference]: Finished difference Result 279 states and 345 transitions. [2018-04-11 21:33:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:33:55,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-04-11 21:33:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:55,045 INFO L225 Difference]: With dead ends: 279 [2018-04-11 21:33:55,045 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 21:33:55,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=133, Unknown=1, NotChecked=24, Total=210 [2018-04-11 21:33:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 21:33:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 226. [2018-04-11 21:33:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-11 21:33:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 280 transitions. [2018-04-11 21:33:55,050 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 280 transitions. Word has length 30 [2018-04-11 21:33:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:55,050 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 280 transitions. [2018-04-11 21:33:55,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:33:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 280 transitions. [2018-04-11 21:33:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 21:33:55,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:55,050 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:55,051 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2092836151, now seen corresponding path program 1 times [2018-04-11 21:33:55,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:55,051 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:55,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:55,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:55,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:55,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:55,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:33:55,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:33:55,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:33:55,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:55,074 INFO L87 Difference]: Start difference. First operand 226 states and 280 transitions. Second operand 3 states. [2018-04-11 21:33:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:55,081 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2018-04-11 21:33:55,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:33:55,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-11 21:33:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:55,082 INFO L225 Difference]: With dead ends: 198 [2018-04-11 21:33:55,082 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 21:33:55,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:33:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 21:33:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-04-11 21:33:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 21:33:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-04-11 21:33:55,085 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 30 [2018-04-11 21:33:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:55,085 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-04-11 21:33:55,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:33:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-04-11 21:33:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 21:33:55,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:55,086 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:55,086 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757376, now seen corresponding path program 1 times [2018-04-11 21:33:55,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:55,087 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:55,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:55,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:55,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:55,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:55,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:33:55,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:33:55,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:33:55,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:55,178 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 9 states. [2018-04-11 21:33:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:55,456 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2018-04-11 21:33:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:33:55,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 21:33:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:55,457 INFO L225 Difference]: With dead ends: 237 [2018-04-11 21:33:55,457 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 21:33:55,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 21:33:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 21:33:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 180. [2018-04-11 21:33:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 21:33:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2018-04-11 21:33:55,461 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 32 [2018-04-11 21:33:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:55,461 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2018-04-11 21:33:55,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:33:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2018-04-11 21:33:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 21:33:55,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:55,462 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:55,462 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757375, now seen corresponding path program 1 times [2018-04-11 21:33:55,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:55,462 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:55,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:55,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:55,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:55,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:33:55,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:33:55,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:33:55,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:33:55,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:33:55,561 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 9 states. [2018-04-11 21:33:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:33:55,928 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2018-04-11 21:33:55,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:33:55,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 21:33:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:33:55,931 INFO L225 Difference]: With dead ends: 236 [2018-04-11 21:33:55,931 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 21:33:55,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-11 21:33:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 21:33:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 179. [2018-04-11 21:33:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 21:33:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2018-04-11 21:33:55,935 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 32 [2018-04-11 21:33:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:33:55,935 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2018-04-11 21:33:55,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:33:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2018-04-11 21:33:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:33:55,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:33:55,936 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:33:55,936 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:33:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1370981878, now seen corresponding path program 1 times [2018-04-11 21:33:55,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:33:55,936 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:33:55,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:55,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:33:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:55,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:33:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:33:56,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:33:56,152 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:33:56,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:33:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:33:56,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:33:56,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:33:56,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:33:56,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:33:56,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:33:56,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 21:33:56,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:33:56,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:33:56,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:33:56,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-11 21:33:56,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 21 treesize of output 19 [2018-04-11 21:33:56,359 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:33:56,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:33:56,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:33:56,386 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 21 treesize of output 19 [2018-04-11 21:33:56,393 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:33:56,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 21:33:56,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:33:56,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:33:56,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:156 [2018-04-11 21:33:56,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:33:56,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-11 21:33:56,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:33:56,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,610 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 61 treesize of output 54 [2018-04-11 21:33:56,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:33:56,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:33:56,644 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 82 treesize of output 78 [2018-04-11 21:33:56,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:33:56,646 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,654 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,675 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 74 treesize of output 67 [2018-04-11 21:33:56,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:33:56,677 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 21:33:56,707 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:152, output treesize:120 [2018-04-11 21:33:56,803 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 105 treesize of output 95 [2018-04-11 21:33:56,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 20 treesize of output 25 [2018-04-11 21:33:56,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,857 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 103 treesize of output 89 [2018-04-11 21:33:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:33:56,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,900 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 97 treesize of output 84 [2018-04-11 21:33:56,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:33:56,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,914 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,938 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 93 treesize of output 76 [2018-04-11 21:33:56,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:33:56,941 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:33:56,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:33:57,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 21:33:57,000 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:209, output treesize:173 [2018-04-11 21:34:01,158 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 75 treesize of output 65 [2018-04-11 21:34:01,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:34:01,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:34:01,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,227 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 107 treesize of output 91 [2018-04-11 21:34:01,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 21:34:01,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 21:34:01,240 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,247 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,261 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 2 xjuncts. [2018-04-11 21:34:01,262 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:120 [2018-04-11 21:34:01,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-11 21:34:01,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:34:01,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-11 21:34:01,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:34:01,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:34:01,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 21:34:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:34:01,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:34:01,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-11 21:34:01,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:34:01,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:34:01,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=574, Unknown=2, NotChecked=0, Total=650 [2018-04-11 21:34:01,573 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 26 states. [2018-04-11 21:34:29,904 WARN L151 SmtUtils]: Spent 4096ms on a formula simplification. DAG size of input: 139 DAG size of output 58 [2018-04-11 21:34:40,038 WARN L151 SmtUtils]: Spent 4067ms on a formula simplification. DAG size of input: 125 DAG size of output 54 [2018-04-11 21:34:44,183 WARN L151 SmtUtils]: Spent 4084ms on a formula simplification. DAG size of input: 129 DAG size of output 58 [2018-04-11 21:35:12,619 WARN L151 SmtUtils]: Spent 10088ms on a formula simplification. DAG size of input: 133 DAG size of output 58 [2018-04-11 21:35:16,782 WARN L151 SmtUtils]: Spent 4082ms on a formula simplification. DAG size of input: 137 DAG size of output 61 [2018-04-11 21:35:26,961 WARN L151 SmtUtils]: Spent 10095ms on a formula simplification. DAG size of input: 142 DAG size of output 62 [2018-04-11 21:35:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:35:40,278 INFO L93 Difference]: Finished difference Result 430 states and 502 transitions. [2018-04-11 21:35:40,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 21:35:40,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-04-11 21:35:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:35:40,279 INFO L225 Difference]: With dead ends: 430 [2018-04-11 21:35:40,279 INFO L226 Difference]: Without dead ends: 430 [2018-04-11 21:35:40,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 92.9s TimeCoverageRelationStatistics Valid=1051, Invalid=3755, Unknown=24, NotChecked=0, Total=4830 [2018-04-11 21:35:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-11 21:35:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 205. [2018-04-11 21:35:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 21:35:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 240 transitions. [2018-04-11 21:35:40,285 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 240 transitions. Word has length 48 [2018-04-11 21:35:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:35:40,285 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 240 transitions. [2018-04-11 21:35:40,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:35:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 240 transitions. [2018-04-11 21:35:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:35:40,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:35:40,286 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:35:40,286 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:35:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039926, now seen corresponding path program 1 times [2018-04-11 21:35:40,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:35:40,286 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:35:40,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:35:40,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:35:40,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:35:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:40,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:35:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:40,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:35:40,490 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:35:40,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:35:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:35:40,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:35:40,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:35:40,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-11 21:35:40,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:35:40,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:35:40,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:35:40,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:35:40,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-11 21:35:40,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 21:35:40,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:35:40,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:40,835 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 54 treesize of output 51 [2018-04-11 21:35:40,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:35:40,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:40,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:72 [2018-04-11 21:35:40,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 94 treesize of output 80 [2018-04-11 21:35:40,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:35:40,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,970 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 55 treesize of output 48 [2018-04-11 21:35:40,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:35:40,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:40,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:41,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:41,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:96 [2018-04-11 21:35:47,089 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 55 treesize of output 46 [2018-04-11 21:35:47,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:47,091 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 32 treesize of output 23 [2018-04-11 21:35:47,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:47,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:35:47,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:47,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:35:47,110 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 33 treesize of output 29 [2018-04-11 21:35:47,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:35:47,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:35:47,118 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 18 treesize of output 10 [2018-04-11 21:35:47,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:35:47,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:47,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:35:47,135 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-04-11 21:35:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:35:47,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:35:47,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-11 21:35:47,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 21:35:47,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 21:35:47,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2018-04-11 21:35:47,166 INFO L87 Difference]: Start difference. First operand 205 states and 240 transitions. Second operand 29 states. [2018-04-11 21:36:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:36:08,786 INFO L93 Difference]: Finished difference Result 534 states and 624 transitions. [2018-04-11 21:36:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 21:36:08,786 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-11 21:36:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:36:08,787 INFO L225 Difference]: With dead ends: 534 [2018-04-11 21:36:08,787 INFO L226 Difference]: Without dead ends: 534 [2018-04-11 21:36:08,788 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=696, Invalid=2362, Unknown=22, NotChecked=0, Total=3080 [2018-04-11 21:36:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-04-11 21:36:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 244. [2018-04-11 21:36:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-11 21:36:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 289 transitions. [2018-04-11 21:36:08,791 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 289 transitions. Word has length 48 [2018-04-11 21:36:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:36:08,791 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 289 transitions. [2018-04-11 21:36:08,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 21:36:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 289 transitions. [2018-04-11 21:36:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:36:08,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:36:08,791 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:36:08,792 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:36:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412237, now seen corresponding path program 1 times [2018-04-11 21:36:08,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:36:08,792 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:36:08,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:36:08,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:36:08,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:36:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:08,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:36:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:08,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:36:08,899 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:36:08,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:36:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:36:08,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:36:08,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:08,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:08,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:36:08,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:08,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:08,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 21:36:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:36:08,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:36:08,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:08,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:08,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:08,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 21:36:09,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:36:09,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-11 21:36:09,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 12 treesize of output 11 [2018-04-11 21:36:09,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:09,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:09,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:09,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-11 21:36:09,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 21:36:09,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:36:09,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:09,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:09,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:09,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-11 21:36:15,088 WARN L151 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-04-11 21:36:17,125 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 38 treesize of output 26 [2018-04-11 21:36:17,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:36:17,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:17,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 21:36:17,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:36:17,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:36:17,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:36:17,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 21:36:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:36:17,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:36:17,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-11 21:36:17,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:36:17,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:36:17,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=372, Unknown=3, NotChecked=0, Total=462 [2018-04-11 21:36:17,190 INFO L87 Difference]: Start difference. First operand 244 states and 289 transitions. Second operand 22 states. [2018-04-11 21:36:42,029 WARN L151 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 59 DAG size of output 35 [2018-04-11 21:36:50,070 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 51 DAG size of output 33 [2018-04-11 21:36:58,156 WARN L151 SmtUtils]: Spent 2017ms on a formula simplification. DAG size of input: 46 DAG size of output 28 [2018-04-11 21:37:00,249 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 53 DAG size of output 31 [2018-04-11 21:37:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:06,756 INFO L93 Difference]: Finished difference Result 766 states and 936 transitions. [2018-04-11 21:37:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 21:37:06,756 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 21:37:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:06,758 INFO L225 Difference]: With dead ends: 766 [2018-04-11 21:37:06,758 INFO L226 Difference]: Without dead ends: 766 [2018-04-11 21:37:06,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=312, Invalid=859, Unknown=19, NotChecked=0, Total=1190 [2018-04-11 21:37:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-11 21:37:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 355. [2018-04-11 21:37:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-11 21:37:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 442 transitions. [2018-04-11 21:37:06,765 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 442 transitions. Word has length 50 [2018-04-11 21:37:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:06,765 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 442 transitions. [2018-04-11 21:37:06,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:37:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 442 transitions. [2018-04-11 21:37:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:37:06,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:06,766 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:37:06,766 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:37:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412236, now seen corresponding path program 1 times [2018-04-11 21:37:06,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:37:06,767 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:37:06,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:37:06,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:37:06,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:37:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:06,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:37:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:06,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:37:06,966 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:37:06,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:37:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:06,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:06,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:37:06,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:07,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:07,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:37:07,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 21:37:07,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:37:07,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:37:07,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:37:07,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:37:07,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 21:37:07,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:07,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:37:07,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:37:07,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:07,090 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-11 21:37:07,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:37:07,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:07,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-11 21:37:07,150 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-11 21:37:07,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:37:07,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,168 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 74 treesize of output 64 [2018-04-11 21:37:07,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:37:07,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:07,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:07,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-11 21:37:13,279 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 51 treesize of output 37 [2018-04-11 21:37:13,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:37:13,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,291 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 30 treesize of output 19 [2018-04-11 21:37:13,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-11 21:37:13,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:37:13,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:37:13,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:13,311 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 21:37:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:13,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:37:13,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-11 21:37:13,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:37:13,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:37:13,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=393, Unknown=3, NotChecked=0, Total=462 [2018-04-11 21:37:13,373 INFO L87 Difference]: Start difference. First operand 355 states and 442 transitions. Second operand 22 states. [2018-04-11 21:37:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:37:14,370 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2018-04-11 21:37:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 21:37:14,370 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 21:37:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:37:14,371 INFO L225 Difference]: With dead ends: 707 [2018-04-11 21:37:14,371 INFO L226 Difference]: Without dead ends: 707 [2018-04-11 21:37:14,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=208, Invalid=845, Unknown=3, NotChecked=0, Total=1056 [2018-04-11 21:37:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-04-11 21:37:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 366. [2018-04-11 21:37:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-11 21:37:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 462 transitions. [2018-04-11 21:37:14,377 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 462 transitions. Word has length 50 [2018-04-11 21:37:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:37:14,377 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 462 transitions. [2018-04-11 21:37:14,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:37:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 462 transitions. [2018-04-11 21:37:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:37:14,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:37:14,378 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:37:14,378 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:37:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash 721092915, now seen corresponding path program 1 times [2018-04-11 21:37:14,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:37:14,378 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:37:14,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:37:14,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:37:14,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:37:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:14,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:37:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:37:14,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:37:14,602 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:37:14,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:37:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:37:14,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:37:14,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:14,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:14,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:37:14,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 21:37:14,728 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 21 treesize of output 16 [2018-04-11 21:37:14,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:14,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:37:14,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,752 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 21 treesize of output 16 [2018-04-11 21:37:14,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:14,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:37:14,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-04-11 21:37:14,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:14,832 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 75 treesize of output 82 [2018-04-11 21:37:14,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:37:14,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,853 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 41 [2018-04-11 21:37:14,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:37:14,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:14,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-04-11 21:37:14,957 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 55 treesize of output 48 [2018-04-11 21:37:14,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:37:14,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:14,994 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 95 treesize of output 81 [2018-04-11 21:37:14,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:37:14,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:15,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:15,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:15,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-04-11 21:37:21,157 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 39 treesize of output 35 [2018-04-11 21:37:21,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:37:21,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:21,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:37:21,177 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 18 treesize of output 10 [2018-04-11 21:37:21,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:37:21,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:37:21,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:37:21,186 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-04-11 21:37:21,263 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-11 21:37:21,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:37:21,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 25 [2018-04-11 21:37:21,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 21:37:21,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 21:37:21,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=3, NotChecked=0, Total=600 [2018-04-11 21:37:21,281 INFO L87 Difference]: Start difference. First operand 366 states and 462 transitions. Second operand 25 states. [2018-04-11 21:38:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:38:01,102 INFO L93 Difference]: Finished difference Result 687 states and 841 transitions. [2018-04-11 21:38:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 21:38:01,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-11 21:38:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:38:01,104 INFO L225 Difference]: With dead ends: 687 [2018-04-11 21:38:01,104 INFO L226 Difference]: Without dead ends: 687 [2018-04-11 21:38:01,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=483, Invalid=2051, Unknown=16, NotChecked=0, Total=2550 [2018-04-11 21:38:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-11 21:38:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 438. [2018-04-11 21:38:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 21:38:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 568 transitions. [2018-04-11 21:38:01,109 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 568 transitions. Word has length 50 [2018-04-11 21:38:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:38:01,110 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 568 transitions. [2018-04-11 21:38:01,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 21:38:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 568 transitions. [2018-04-11 21:38:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 21:38:01,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:38:01,110 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:38:01,110 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:38:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash -660150828, now seen corresponding path program 1 times [2018-04-11 21:38:01,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:38:01,110 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:38:01,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:38:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:38:01,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:38:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:38:01,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:38:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:38:01,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:38:01,384 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:38:01,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:38:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:38:01,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:38:01,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:01,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:01,453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:38:01,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 21:38:01,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:38:01,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:38:01,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 21:38:01,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:38:01,526 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 36 treesize of output 43 [2018-04-11 21:38:01,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:38:01,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:38:01,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 21:38:01,578 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 49 treesize of output 39 [2018-04-11 21:38:01,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:38:01,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:01,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:38:01,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-04-11 21:38:07,681 WARN L151 SmtUtils]: Spent 2008ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-04-11 21:38:09,701 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 37 treesize of output 25 [2018-04-11 21:38:09,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:38:09,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:09,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 21:38:09,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:38:09,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:38:09,715 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-11 21:38:09,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2018-04-11 21:38:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:38:09,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:38:09,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-04-11 21:38:09,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:38:09,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:38:09,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=557, Unknown=3, NotChecked=0, Total=650 [2018-04-11 21:38:09,755 INFO L87 Difference]: Start difference. First operand 438 states and 568 transitions. Second operand 26 states. [2018-04-11 21:38:38,174 WARN L151 SmtUtils]: Spent 2041ms on a formula simplification. DAG size of input: 75 DAG size of output 50 [2018-04-11 21:38:46,247 WARN L151 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 64 DAG size of output 48 [2018-04-11 21:39:00,395 WARN L151 SmtUtils]: Spent 2021ms on a formula simplification. DAG size of input: 50 DAG size of output 36 [2018-04-11 21:39:02,441 WARN L151 SmtUtils]: Spent 2022ms on a formula simplification. DAG size of input: 53 DAG size of output 39 [2018-04-11 21:39:04,486 WARN L151 SmtUtils]: Spent 2024ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-04-11 21:39:06,546 WARN L151 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 53 DAG size of output 39 [2018-04-11 21:39:21,011 WARN L151 SmtUtils]: Spent 2032ms on a formula simplification. DAG size of input: 57 DAG size of output 43 [2018-04-11 21:39:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:39:21,024 INFO L93 Difference]: Finished difference Result 760 states and 953 transitions. [2018-04-11 21:39:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 21:39:21,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-04-11 21:39:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:39:21,025 INFO L225 Difference]: With dead ends: 760 [2018-04-11 21:39:21,025 INFO L226 Difference]: Without dead ends: 752 [2018-04-11 21:39:21,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 67.1s TimeCoverageRelationStatistics Valid=484, Invalid=1747, Unknown=25, NotChecked=0, Total=2256 [2018-04-11 21:39:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-04-11 21:39:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 387. [2018-04-11 21:39:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-04-11 21:39:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 496 transitions. [2018-04-11 21:39:21,031 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 496 transitions. Word has length 52 [2018-04-11 21:39:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:39:21,031 INFO L459 AbstractCegarLoop]: Abstraction has 387 states and 496 transitions. [2018-04-11 21:39:21,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:39:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 496 transitions. [2018-04-11 21:39:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 21:39:21,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:39:21,032 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:39:21,032 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:39:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -338982956, now seen corresponding path program 1 times [2018-04-11 21:39:21,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:39:21,033 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:39:21,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:39:21,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:39:21,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:39:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:39:21,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:39:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:39:21,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:39:21,180 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:39:21,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:39:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:39:21,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:39:21,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:21,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:21,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:39:21,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 21:39:21,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:39:21,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:39:21,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:39 [2018-04-11 21:39:21,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:39:21,319 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 42 [2018-04-11 21:39:21,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:39:21,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:39:21,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:52 [2018-04-11 21:39:21,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 21:39:21,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:39:21,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:21,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:39:21,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:64 [2018-04-11 21:39:29,468 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 59 treesize of output 44 [2018-04-11 21:39:29,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:39:29,470 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 25 treesize of output 17 [2018-04-11 21:39:29,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:29,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 21:39:29,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:39:29,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:39:29,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:39:29,491 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:76, output treesize:15 [2018-04-11 21:39:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:39:29,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:39:29,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-11 21:39:29,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 21:39:29,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 21:39:29,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=565, Unknown=4, NotChecked=0, Total=702 [2018-04-11 21:39:29,630 INFO L87 Difference]: Start difference. First operand 387 states and 496 transitions. Second operand 27 states. [2018-04-11 21:40:12,189 WARN L151 SmtUtils]: Spent 4035ms on a formula simplification. DAG size of input: 65 DAG size of output 58 [2018-04-11 21:40:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:40:43,912 INFO L93 Difference]: Finished difference Result 1083 states and 1382 transitions. [2018-04-11 21:40:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 21:40:43,912 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-04-11 21:40:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:40:43,914 INFO L225 Difference]: With dead ends: 1083 [2018-04-11 21:40:43,914 INFO L226 Difference]: Without dead ends: 1083 [2018-04-11 21:40:43,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=627, Invalid=1894, Unknown=29, NotChecked=0, Total=2550 [2018-04-11 21:40:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-04-11 21:40:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 513. [2018-04-11 21:40:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-11 21:40:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 667 transitions. [2018-04-11 21:40:43,924 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 667 transitions. Word has length 52 [2018-04-11 21:40:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:40:43,924 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 667 transitions. [2018-04-11 21:40:43,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 21:40:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 667 transitions. [2018-04-11 21:40:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 21:40:43,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:40:43,925 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:40:43,925 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:40:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash -338982955, now seen corresponding path program 1 times [2018-04-11 21:40:43,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:40:43,925 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:40:43,926 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:40:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:40:43,926 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:40:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:40:43,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:40:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:40:44,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:40:44,160 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:40:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:40:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:40:44,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:40:44,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-11 21:40:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:40:44,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:40:44,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-11 21:40:44,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 21:40:44,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:40:44,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:40:44,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:40:44,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,247 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-11 21:40:44,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-04-11 21:40:44,271 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 23 treesize of output 21 [2018-04-11 21:40:44,277 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 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 21:40:44,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:40:44,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:40:44,302 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 23 treesize of output 21 [2018-04-11 21:40:44,304 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 18 treesize of output 19 [2018-04-11 21:40:44,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:40:44,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:109 [2018-04-11 21:40:44,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:40:44,402 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 86 treesize of output 87 [2018-04-11 21:40:44,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:40:44,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:40:44,444 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 76 treesize of output 70 [2018-04-11 21:40:44,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:40:44,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:40:44,483 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 101 treesize of output 102 [2018-04-11 21:40:44,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:40:44,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:40:44,522 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 91 treesize of output 85 [2018-04-11 21:40:44,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:40:44,524 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,532 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 21:40:44,553 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:188, output treesize:148 [2018-04-11 21:40:44,657 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 128 treesize of output 111 [2018-04-11 21:40:44,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:40:44,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,708 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 110 treesize of output 96 [2018-04-11 21:40:44,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:40:44,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,751 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 100 treesize of output 83 [2018-04-11 21:40:44,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:40:44,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,797 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 118 treesize of output 104 [2018-04-11 21:40:44,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:40:44,799 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,809 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:44,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 21:40:44,830 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:239, output treesize:199 [2018-04-11 21:40:51,382 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 71 treesize of output 60 [2018-04-11 21:40:51,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:40:51,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:51,390 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:40:51,391 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 46 treesize of output 30 [2018-04-11 21:40:51,391 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:51,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:51,405 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 28 treesize of output 26 [2018-04-11 21:40:51,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:40:51,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:51,410 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:40:51,410 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 15 treesize of output 11 [2018-04-11 21:40:51,410 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:40:51,412 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:40:51,417 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-11 21:40:51,418 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:98, output treesize:13 [2018-04-11 21:40:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:40:51,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:40:51,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 31 [2018-04-11 21:40:51,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 21:40:51,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 21:40:51,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=877, Unknown=3, NotChecked=0, Total=992 [2018-04-11 21:40:51,489 INFO L87 Difference]: Start difference. First operand 513 states and 667 transitions. Second operand 32 states. [2018-04-11 21:41:22,230 WARN L151 SmtUtils]: Spent 30176ms on a formula simplification. DAG size of input: 155 DAG size of output 96 [2018-04-11 21:41:52,435 WARN L151 SmtUtils]: Spent 30160ms on a formula simplification. DAG size of input: 148 DAG size of output 93 [2018-04-11 21:42:22,679 WARN L151 SmtUtils]: Spent 30197ms on a formula simplification. DAG size of input: 165 DAG size of output 102 [2018-04-11 21:42:22,899 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 66 DAG size of output 64 [2018-04-11 21:42:23,142 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 128 DAG size of output 69 [2018-04-11 21:42:23,429 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 132 DAG size of output 90 [2018-04-11 21:42:23,734 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 173 DAG size of output 107 [2018-04-11 21:42:24,000 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 131 DAG size of output 56 [2018-04-11 21:42:24,256 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-04-11 21:42:56,175 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 135 DAG size of output 74 [2018-04-11 21:42:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:42:56,197 INFO L93 Difference]: Finished difference Result 1081 states and 1371 transitions. [2018-04-11 21:42:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 21:42:56,197 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 52 [2018-04-11 21:42:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:42:56,199 INFO L225 Difference]: With dead ends: 1081 [2018-04-11 21:42:56,199 INFO L226 Difference]: Without dead ends: 1081 [2018-04-11 21:42:56,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 117.6s TimeCoverageRelationStatistics Valid=631, Invalid=2779, Unknown=12, NotChecked=0, Total=3422 [2018-04-11 21:42:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-04-11 21:42:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 525. [2018-04-11 21:42:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-11 21:42:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 687 transitions. [2018-04-11 21:42:56,207 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 687 transitions. Word has length 52 [2018-04-11 21:42:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:42:56,208 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 687 transitions. [2018-04-11 21:42:56,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 21:42:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 687 transitions. [2018-04-11 21:42:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 21:42:56,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:42:56,209 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:42:56,209 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:42:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash -344708594, now seen corresponding path program 1 times [2018-04-11 21:42:56,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:42:56,209 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:42:56,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:42:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:42:56,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:42:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:42:56,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:42:56,258 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-11 21:42:56,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:42:56,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:42:56,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:42:56,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:42:56,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:42:56,260 INFO L87 Difference]: Start difference. First operand 525 states and 687 transitions. Second operand 6 states. [2018-04-11 21:42:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:42:56,370 INFO L93 Difference]: Finished difference Result 526 states and 681 transitions. [2018-04-11 21:42:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:42:56,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-11 21:42:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:42:56,371 INFO L225 Difference]: With dead ends: 526 [2018-04-11 21:42:56,371 INFO L226 Difference]: Without dead ends: 526 [2018-04-11 21:42:56,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:42:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-04-11 21:42:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 525. [2018-04-11 21:42:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-11 21:42:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 681 transitions. [2018-04-11 21:42:56,376 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 681 transitions. Word has length 52 [2018-04-11 21:42:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:42:56,376 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 681 transitions. [2018-04-11 21:42:56,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:42:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 681 transitions. [2018-04-11 21:42:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:42:56,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:42:56,382 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-11 21:42:56,382 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-11 21:42:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1911310923, now seen corresponding path program 1 times [2018-04-11 21:42:56,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:42:56,382 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:42:56,383 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:42:56,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:42:56,383 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:42:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:42:56,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:42:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:42:56,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:42:56,605 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:42:56,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:42:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:42:56,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:42:56,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:42:56,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:42:56,668 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:42:56,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 21:42:56,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:42:56,692 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-11 21:42:56,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 21:42:56,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:42:56,733 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-11 21:42:56,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 14 treesize of output 13 [2018-04-11 21:42:56,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:42:56,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 21:42:56,783 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-11 21:42:56,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:42:56,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:42:56,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:42:56,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:55 [2018-04-11 21:43:04,855 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 58 treesize of output 43 [2018-04-11 21:43:04,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 21:43:04,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:43:04,863 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 24 treesize of output 21 [2018-04-11 21:43:04,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:43:04,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:43:04,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:43:04,872 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:22 [2018-04-11 21:43:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:43:04,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:43:04,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-04-11 21:43:04,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 21:43:04,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 21:43:04,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=713, Unknown=4, NotChecked=0, Total=812 [2018-04-11 21:43:04,946 INFO L87 Difference]: Start difference. First operand 525 states and 681 transitions. Second operand 29 states. [2018-04-11 21:43:41,361 WARN L151 SmtUtils]: Spent 4034ms on a formula simplification. DAG size of input: 75 DAG size of output 44 [2018-04-11 21:44:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:44:00,456 INFO L93 Difference]: Finished difference Result 921 states and 1175 transitions. [2018-04-11 21:44:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:44:00,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-04-11 21:44:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:44:00,457 INFO L225 Difference]: With dead ends: 921 [2018-04-11 21:44:00,457 INFO L226 Difference]: Without dead ends: 921 [2018-04-11 21:44:00,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=441, Invalid=1606, Unknown=23, NotChecked=0, Total=2070 [2018-04-11 21:44:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-04-11 21:44:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 525. [2018-04-11 21:44:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-11 21:44:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 679 transitions. [2018-04-11 21:44:00,462 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 679 transitions. Word has length 54 [2018-04-11 21:44:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:44:00,462 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 679 transitions. [2018-04-11 21:44:00,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 21:44:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 679 transitions. [2018-04-11 21:44:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:44:00,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:44:00,463 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-11 21:44:00,463 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-11 21:44:00,463 INFO L82 PathProgramCache]: Analyzing trace with hash -640106730, now seen corresponding path program 1 times [2018-04-11 21:44:00,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:44:00,464 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:44:00,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:44:00,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:44:00,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:44:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:44:00,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:44:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:44:00,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:44:00,659 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:44:00,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:44:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:44:00,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:44:00,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:44:00,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:44:00,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:44:00,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 21:44:00,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:44:00,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:44:00,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 21:44:00,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:44:00,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-11 21:44:00,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:44:00,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:44:00,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-11 21:44:00,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 21:44:00,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:44:00,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:44:00,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:44:00,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 21:44:06,900 WARN L151 SmtUtils]: Spent 2016ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-11 21:44:08,992 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 46 treesize of output 39 [2018-04-11 21:44:08,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:44:08,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:44:08,998 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:44:08,998 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 25 treesize of output 17 [2018-04-11 21:44:08,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:44:09,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:44:09,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:44:09,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 21:44:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:44:09,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:44:09,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-04-11 21:44:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 21:44:09,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 21:44:09,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=631, Unknown=3, NotChecked=0, Total=756 [2018-04-11 21:44:09,115 INFO L87 Difference]: Start difference. First operand 525 states and 679 transitions. Second operand 28 states. [2018-04-11 21:45:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:45:07,357 INFO L93 Difference]: Finished difference Result 949 states and 1203 transitions. [2018-04-11 21:45:07,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:45:07,357 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-04-11 21:45:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:45:07,358 INFO L225 Difference]: With dead ends: 949 [2018-04-11 21:45:07,359 INFO L226 Difference]: Without dead ends: 949 [2018-04-11 21:45:07,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=539, Invalid=1598, Unknown=25, NotChecked=0, Total=2162 [2018-04-11 21:45:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-04-11 21:45:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 528. [2018-04-11 21:45:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-11 21:45:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 683 transitions. [2018-04-11 21:45:07,363 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 683 transitions. Word has length 56 [2018-04-11 21:45:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:45:07,363 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 683 transitions. [2018-04-11 21:45:07,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 21:45:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 683 transitions. [2018-04-11 21:45:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:45:07,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:45:07,364 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-11 21:45:07,364 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-11 21:45:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash -640106729, now seen corresponding path program 1 times [2018-04-11 21:45:07,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:45:07,364 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:45:07,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:45:07,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:45:07,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:45:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:45:07,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:45:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:45:07,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:45:07,599 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:45:07,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:45:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:45:07,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:45:07,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:45:07,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:07,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:07,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:45:07,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 21:45:07,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:45:07,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:45:07,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:45:07,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:45:07,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-11 21:45:07,714 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 33 treesize of output 34 [2018-04-11 21:45:07,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:45:07,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,731 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 58 treesize of output 52 [2018-04-11 21:45:07,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:45:07,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:07,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:66 [2018-04-11 21:45:07,789 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 48 treesize of output 41 [2018-04-11 21:45:07,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:45:07,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,810 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-11 21:45:07,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:45:07,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:07,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:07,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-11 21:45:13,880 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 51 treesize of output 37 [2018-04-11 21:45:13,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:45:13,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,886 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 30 treesize of output 19 [2018-04-11 21:45:13,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-11 21:45:13,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:45:13,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:45:13,901 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:13,905 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-11 21:45:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:45:13,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:45:13,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-04-11 21:45:13,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 21:45:13,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 21:45:13,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2018-04-11 21:45:13,942 INFO L87 Difference]: Start difference. First operand 528 states and 683 transitions. Second operand 21 states. [2018-04-11 21:45:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:45:14,987 INFO L93 Difference]: Finished difference Result 899 states and 1137 transitions. [2018-04-11 21:45:14,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 21:45:14,987 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-11 21:45:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:45:14,988 INFO L225 Difference]: With dead ends: 899 [2018-04-11 21:45:14,988 INFO L226 Difference]: Without dead ends: 899 [2018-04-11 21:45:14,989 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=365, Invalid=1038, Unknown=3, NotChecked=0, Total=1406 [2018-04-11 21:45:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-11 21:45:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 562. [2018-04-11 21:45:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-04-11 21:45:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 725 transitions. [2018-04-11 21:45:14,992 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 725 transitions. Word has length 56 [2018-04-11 21:45:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:45:14,993 INFO L459 AbstractCegarLoop]: Abstraction has 562 states and 725 transitions. [2018-04-11 21:45:14,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 21:45:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 725 transitions. [2018-04-11 21:45:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:45:14,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:45:14,993 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-11 21:45:14,993 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-11 21:45:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash -645832368, now seen corresponding path program 1 times [2018-04-11 21:45:14,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:45:14,993 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:45:14,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:45:14,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:45:14,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:45:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:45:15,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:45:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:45:15,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:45:15,217 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:45:15,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:45:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:45:15,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:45:15,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:15,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:15,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:45:15,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 21:45:15,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 11 treesize of output 8 [2018-04-11 21:45:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:45:15,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-11 21:45:15,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 21:45:15,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:45:15,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:15,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-11 21:45:15,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:45:15,366 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-11 21:45:15,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:45:15,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:15,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:15,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-11 21:45:21,415 WARN L151 SmtUtils]: Spent 2013ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-04-11 21:45:21,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:21,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:21,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:21,426 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-11 21:45:21,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:21,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:59 [2018-04-11 21:45:21,479 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 47 [2018-04-11 21:45:21,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:21,482 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 41 treesize of output 54 [2018-04-11 21:45:21,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,501 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-11 21:45:21,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-04-11 21:45:21,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:21,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:45:21,584 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 89 treesize of output 99 [2018-04-11 21:45:21,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:45:21,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:21,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:90 [2018-04-11 21:45:21,763 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 104 treesize of output 93 [2018-04-11 21:45:21,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 21:45:21,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:45:21,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:21,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-04-11 21:45:27,846 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-11 21:45:29,887 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 67 [2018-04-11 21:45:29,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-11 21:45:29,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:29,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2018-04-11 21:45:29,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:45:29,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 21:45:29,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:45:29,907 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-11 21:45:29,912 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-11 21:45:29,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:28 [2018-04-11 21:45:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:45:30,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:45:30,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2018-04-11 21:45:30,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 21:45:30,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 21:45:30,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=790, Unknown=5, NotChecked=0, Total=992 [2018-04-11 21:45:30,099 INFO L87 Difference]: Start difference. First operand 562 states and 725 transitions. Second operand 32 states. [2018-04-11 21:45:46,641 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-04-11 21:46:01,088 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 66 DAG size of output 56 [2018-04-11 21:46:17,389 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 74 DAG size of output 56 [2018-04-11 21:46:19,572 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 102 DAG size of output 60 [2018-04-11 21:46:25,778 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 97 DAG size of output 58 [2018-04-11 21:46:32,165 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 76 DAG size of output 45 [2018-04-11 21:46:34,632 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 111 DAG size of output 61 [2018-04-11 21:47:01,557 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-04-11 21:47:08,897 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 90 DAG size of output 48 [2018-04-11 21:47:15,154 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 81 DAG size of output 50 [2018-04-11 21:47:21,608 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 92 DAG size of output 53 [2018-04-11 21:47:35,933 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 61 DAG size of output 51 [2018-04-11 21:47:50,120 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-04-11 21:48:04,353 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 69 DAG size of output 51 [2018-04-11 21:48:08,526 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 97 DAG size of output 55 [2018-04-11 21:48:09,125 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 106 DAG size of output 56 [2018-04-11 21:48:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:11,751 INFO L93 Difference]: Finished difference Result 1912 states and 2439 transitions. [2018-04-11 21:48:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-11 21:48:11,752 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-11 21:48:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:11,755 INFO L225 Difference]: With dead ends: 1912 [2018-04-11 21:48:11,755 INFO L226 Difference]: Without dead ends: 1912 [2018-04-11 21:48:11,756 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2686 ImplicationChecksByTransitivity, 137.3s TimeCoverageRelationStatistics Valid=1835, Invalid=6659, Unknown=62, NotChecked=0, Total=8556 [2018-04-11 21:48:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-04-11 21:48:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 656. [2018-04-11 21:48:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-04-11 21:48:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 856 transitions. [2018-04-11 21:48:11,763 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 856 transitions. Word has length 56 [2018-04-11 21:48:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:11,763 INFO L459 AbstractCegarLoop]: Abstraction has 656 states and 856 transitions. [2018-04-11 21:48:11,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 21:48:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 856 transitions. [2018-04-11 21:48:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 21:48:11,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:11,764 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-11 21:48:11,764 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-11 21:48:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash -645832367, now seen corresponding path program 1 times [2018-04-11 21:48:11,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:11,764 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:11,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:11,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:11,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:11,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:12,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:12,090 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:48:12,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:12,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:12,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:48:12,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:12,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:12,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 21:48:12,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 21:48:12,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:48:12,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:48:12,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:48:12,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:48:12,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-04-11 21:48:12,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:12,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 21:48:12,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 12 treesize of output 11 [2018-04-11 21:48:12,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:12,236 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 57 treesize of output 64 [2018-04-11 21:48:12,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:48:12,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:12,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-11 21:48:12,329 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:12,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:12,337 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 91 treesize of output 92 [2018-04-11 21:48:12,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:48:12,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:12,374 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-11 21:48:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-11 21:48:12,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:12,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:12,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:93 Received shutdown request... [2018-04-11 21:48:16,431 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 21:48:16,431 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 21:48:16,435 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 21:48:16,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:48:16 BoogieIcfgContainer [2018-04-11 21:48:16,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 21:48:16,435 INFO L168 Benchmark]: Toolchain (without parser) took 866821.93 ms. Allocated memory was 400.6 MB in the beginning and 601.9 MB in the end (delta: 201.3 MB). Free memory was 331.4 MB in the beginning and 555.3 MB in the end (delta: -223.9 MB). Peak memory consumption was 135.6 MB. Max. memory is 5.3 GB. [2018-04-11 21:48:16,436 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 400.6 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 21:48:16,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.25 ms. Allocated memory is still 400.6 MB. Free memory was 331.4 MB in the beginning and 306.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 21:48:16,436 INFO L168 Benchmark]: Boogie Preprocessor took 43.18 ms. Allocated memory is still 400.6 MB. Free memory was 306.3 MB in the beginning and 303.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 21:48:16,437 INFO L168 Benchmark]: RCFGBuilder took 443.16 ms. Allocated memory was 400.6 MB in the beginning and 584.6 MB in the end (delta: 184.0 MB). Free memory was 303.7 MB in the beginning and 503.6 MB in the end (delta: -199.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-11 21:48:16,437 INFO L168 Benchmark]: TraceAbstraction took 866097.59 ms. Allocated memory was 584.6 MB in the beginning and 601.9 MB in the end (delta: 17.3 MB). Free memory was 503.6 MB in the beginning and 555.3 MB in the end (delta: -51.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 5.3 GB. [2018-04-11 21:48:16,437 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.22 ms. Allocated memory is still 400.6 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 235.25 ms. Allocated memory is still 400.6 MB. Free memory was 331.4 MB in the beginning and 306.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.18 ms. Allocated memory is still 400.6 MB. Free memory was 306.3 MB in the beginning and 303.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 443.16 ms. Allocated memory was 400.6 MB in the beginning and 584.6 MB in the end (delta: 184.0 MB). Free memory was 303.7 MB in the beginning and 503.6 MB in the end (delta: -199.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 866097.59 ms. Allocated memory was 584.6 MB in the beginning and 601.9 MB in the end (delta: 17.3 MB). Free memory was 503.6 MB in the beginning and 555.3 MB in the end (delta: -51.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 46. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 55 error locations. TIMEOUT Result, 866.0s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 761.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3861 SDtfs, 20311 SDslu, 22017 SDs, 0 SdLazy, 24056 SolverSat, 1895 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 153.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1326 GetRequests, 546 SyntacticMatches, 30 SemanticMatches, 750 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8815 ImplicationChecksByTransitivity, 700.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=656occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 6744 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 98.5s InterpolantComputationTime, 1851 NumberOfCodeBlocks, 1851 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1803 ConstructedInterpolants, 237 QuantifiedInterpolants, 1565114 SizeOfPredicates, 197 NumberOfNonLiveVariables, 2635 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 48 InterpolantComputations, 23 PerfectInterpolantSequences, 72/213 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_21-48-16-446.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_21-48-16-446.csv Completed graceful shutdown