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_dsw_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 13:10:08,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 13:10:08,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 13:10:08,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 13:10:08,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 13:10:08,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 13:10:08,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 13:10:08,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 13:10:08,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 13:10:08,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 13:10:08,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 13:10:08,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 13:10:08,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 13:10:08,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 13:10:08,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 13:10:08,218 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 13:10:08,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 13:10:08,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 13:10:08,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 13:10:08,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 13:10:08,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 13:10:08,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 13:10:08,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 13:10:08,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 13:10:08,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 13:10:08,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 13:10:08,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 13:10:08,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 13:10:08,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 13:10:08,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 13:10:08,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 13:10:08,229 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-12 13:10:08,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 13:10:08,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 13:10:08,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 13:10:08,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 13:10:08,241 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 13:10:08,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 13:10:08,241 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 13:10:08,241 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 13:10:08,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 13:10:08,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 13:10:08,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 13:10:08,242 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 13:10:08,242 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 13:10:08,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 13:10:08,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 13:10:08,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 13:10:08,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 13:10:08,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 13:10:08,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 13:10:08,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 13:10:08,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 13:10:08,243 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 13:10:08,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 13:10:08,244 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 13:10:08,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 13:10:08,284 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 13:10:08,287 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 13:10:08,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 13:10:08,289 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 13:10:08,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,591 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4cc7c5180 [2018-04-12 13:10:08,725 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 13:10:08,725 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 13:10:08,725 INFO L168 CDTParser]: Scanning tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,732 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 13:10:08,732 INFO L215 ultiparseSymbolTable]: [2018-04-12 13:10:08,732 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 13:10:08,733 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____int8_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_short in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__timer_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__register_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____nlink_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_int64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,733 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__ino_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__int32_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____uint64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____swblk_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__gid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__ldiv_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__ssize_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____uid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____timer_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____time_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,734 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__int8_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____ssize_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__key_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____fd_mask in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_int8_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____int32_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____suseconds_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__div_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____clockid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,735 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__caddr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_int in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__mode_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____u_short in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____sigset_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__wchar_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____rlim_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__fd_set in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____intptr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,736 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____u_quad_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__blksize_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____ino_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____mode_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____socklen_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__int16_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__lldiv_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__uid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____uint32_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,737 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__quad_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_int16_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__blkcnt_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__off_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_once_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__size_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____u_long in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_char in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____int16_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,738 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____pthread_list_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__sigset_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__clock_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____quad_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_quad_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____fsid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__ulong in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_long in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____u_char in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____off64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,739 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____gid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____off_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____caddr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____qaddr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____pid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____uint16_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____blksize_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____dev_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__suseconds_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__int64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____loff_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__daddr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__u_int32_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____id_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__fsid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____clock_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____uint8_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__time_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__clockid_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____rlim64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____daddr_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__loff_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__uint in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____useconds_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__fd_mask in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__ushort in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__nlink_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____int64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____key_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____ino64_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_key_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__id_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____u_int in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i__dev_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_dsw_true_valid_memsafety_false_termination_i____blkcnt_t in tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:08,754 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4cc7c5180 [2018-04-12 13:10:08,757 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 13:10:08,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 13:10:08,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 13:10:08,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 13:10:08,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 13:10:08,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:08,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61da3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08, skipping insertion in model container [2018-04-12 13:10:08,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:08,776 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:10:08,794 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:10:08,900 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:10:08,935 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:10:08,941 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-12 13:10:08,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08 WrapperNode [2018-04-12 13:10:08,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 13:10:08,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 13:10:08,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 13:10:08,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 13:10:08,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:08,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:08,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:08,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:09,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:09,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:09,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... [2018-04-12 13:10:09,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 13:10:09,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 13:10:09,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 13:10:09,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 13:10:09,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 13:10:09,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 13:10:09,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 13:10:09,086 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 13:10:09,087 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 13:10:09,088 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 13:10:09,089 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 13:10:09,090 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 13:10:09,091 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 13:10:09,092 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 13:10:09,093 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 13:10:09,094 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 13:10:09,095 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 13:10:09,096 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 13:10:09,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 13:10:09,542 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 13:10:09,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:10:09 BoogieIcfgContainer [2018-04-12 13:10:09,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 13:10:09,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 13:10:09,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 13:10:09,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 13:10:09,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 01:10:08" (1/3) ... [2018-04-12 13:10:09,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77debad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:10:09, skipping insertion in model container [2018-04-12 13:10:09,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:10:08" (2/3) ... [2018-04-12 13:10:09,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77debad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:10:09, skipping insertion in model container [2018-04-12 13:10:09,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:10:09" (3/3) ... [2018-04-12 13:10:09,548 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-04-12 13:10:09,553 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 13:10:09,558 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-04-12 13:10:09,588 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 13:10:09,589 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 13:10:09,589 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 13:10:09,589 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 13:10:09,589 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 13:10:09,589 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 13:10:09,589 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 13:10:09,589 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 13:10:09,589 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 13:10:09,590 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 13:10:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states. [2018-04-12 13:10:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:10:09,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:09,613 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:09,613 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1694349239, now seen corresponding path program 1 times [2018-04-12 13:10:09,618 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:09,618 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:09,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:09,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:09,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:09,682 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:09,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:09,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:10:09,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:10:09,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:10:09,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:10:09,737 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 4 states. [2018-04-12 13:10:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:09,927 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2018-04-12 13:10:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:10:09,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:10:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:09,938 INFO L225 Difference]: With dead ends: 192 [2018-04-12 13:10:09,938 INFO L226 Difference]: Without dead ends: 189 [2018-04-12 13:10:09,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-12 13:10:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2018-04-12 13:10:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-12 13:10:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2018-04-12 13:10:09,975 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 8 [2018-04-12 13:10:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:09,975 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2018-04-12 13:10:09,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:10:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2018-04-12 13:10:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:10:09,976 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:09,976 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:09,976 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1694349240, now seen corresponding path program 1 times [2018-04-12 13:10:09,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:09,976 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:09,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:09,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:09,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:09,988 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:10,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:10,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:10:10,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:10:10,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:10:10,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:10:10,017 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand 4 states. [2018-04-12 13:10:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:10,158 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2018-04-12 13:10:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:10:10,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:10:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:10,159 INFO L225 Difference]: With dead ends: 170 [2018-04-12 13:10:10,159 INFO L226 Difference]: Without dead ends: 170 [2018-04-12 13:10:10,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-12 13:10:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-04-12 13:10:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-12 13:10:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-04-12 13:10:10,165 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 8 [2018-04-12 13:10:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:10,165 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-04-12 13:10:10,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:10:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-04-12 13:10:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 13:10:10,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:10,165 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:10,165 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 804705476, now seen corresponding path program 1 times [2018-04-12 13:10:10,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:10,166 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:10,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:10,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:10,174 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:10,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:10,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:10:10,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:10:10,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:10:10,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:10:10,205 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 4 states. [2018-04-12 13:10:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:10,376 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2018-04-12 13:10:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:10:10,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 13:10:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:10,377 INFO L225 Difference]: With dead ends: 186 [2018-04-12 13:10:10,377 INFO L226 Difference]: Without dead ends: 186 [2018-04-12 13:10:10,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-12 13:10:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 157. [2018-04-12 13:10:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-12 13:10:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-04-12 13:10:10,385 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 14 [2018-04-12 13:10:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:10,386 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-04-12 13:10:10,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:10:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-04-12 13:10:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 13:10:10,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:10,386 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:10,386 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 804705477, now seen corresponding path program 1 times [2018-04-12 13:10:10,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:10,387 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:10,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:10,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:10,399 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:10,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:10,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:10:10,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:10:10,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:10:10,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:10,436 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 5 states. [2018-04-12 13:10:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:10,604 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2018-04-12 13:10:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:10:10,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-12 13:10:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:10,607 INFO L225 Difference]: With dead ends: 215 [2018-04-12 13:10:10,607 INFO L226 Difference]: Without dead ends: 215 [2018-04-12 13:10:10,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 13:10:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-12 13:10:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 192. [2018-04-12 13:10:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-12 13:10:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 219 transitions. [2018-04-12 13:10:10,615 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 219 transitions. Word has length 14 [2018-04-12 13:10:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:10,616 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 219 transitions. [2018-04-12 13:10:10,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:10:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2018-04-12 13:10:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 13:10:10,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:10,616 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:10,617 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1368346758, now seen corresponding path program 1 times [2018-04-12 13:10:10,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:10,617 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:10,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:10,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:10,629 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:10,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:10,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 13:10:10,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 13:10:10,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 13:10:10,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 13:10:10,664 INFO L87 Difference]: Start difference. First operand 192 states and 219 transitions. Second operand 7 states. [2018-04-12 13:10:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:10,790 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2018-04-12 13:10:10,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 13:10:10,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-04-12 13:10:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:10,791 INFO L225 Difference]: With dead ends: 257 [2018-04-12 13:10:10,791 INFO L226 Difference]: Without dead ends: 257 [2018-04-12 13:10:10,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-12 13:10:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-12 13:10:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 193. [2018-04-12 13:10:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-12 13:10:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2018-04-12 13:10:10,797 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 18 [2018-04-12 13:10:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:10,797 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2018-04-12 13:10:10,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 13:10:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2018-04-12 13:10:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 13:10:10,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:10,798 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:10,798 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash 888605583, now seen corresponding path program 1 times [2018-04-12 13:10:10,798 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:10,798 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:10,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:10,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:10,810 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:10,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-12 13:10:10,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:10,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 13:10:10,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:10:10,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:10:10,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:10,840 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 5 states. [2018-04-12 13:10:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:10,945 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2018-04-12 13:10:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:10:10,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-04-12 13:10:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:10,946 INFO L225 Difference]: With dead ends: 213 [2018-04-12 13:10:10,946 INFO L226 Difference]: Without dead ends: 213 [2018-04-12 13:10:10,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 13:10:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-12 13:10:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 192. [2018-04-12 13:10:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-12 13:10:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 218 transitions. [2018-04-12 13:10:10,951 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 218 transitions. Word has length 21 [2018-04-12 13:10:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:10,952 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 218 transitions. [2018-04-12 13:10:10,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:10:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-04-12 13:10:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 13:10:10,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:10,952 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:10,953 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1657520315, now seen corresponding path program 1 times [2018-04-12 13:10:10,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:10,953 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:10,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:10,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:10,965 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:10,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:10,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:10:10,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:10:10,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:10:10,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:10:10,977 INFO L87 Difference]: Start difference. First operand 192 states and 218 transitions. Second operand 3 states. [2018-04-12 13:10:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:10,982 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-04-12 13:10:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:10:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-12 13:10:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:10,983 INFO L225 Difference]: With dead ends: 194 [2018-04-12 13:10:10,983 INFO L226 Difference]: Without dead ends: 194 [2018-04-12 13:10:10,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:10:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-12 13:10:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-04-12 13:10:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 13:10:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-04-12 13:10:10,987 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 22 [2018-04-12 13:10:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:10,987 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-04-12 13:10:10,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:10:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-04-12 13:10:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 13:10:10,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:10,988 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:10,988 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1511147928, now seen corresponding path program 1 times [2018-04-12 13:10:10,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:10,988 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:10,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:10,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:10,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:11,002 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:11,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:11,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:10:11,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:10:11,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:10:11,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:10:11,055 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 6 states. [2018-04-12 13:10:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:11,229 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2018-04-12 13:10:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 13:10:11,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-12 13:10:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:11,230 INFO L225 Difference]: With dead ends: 242 [2018-04-12 13:10:11,231 INFO L226 Difference]: Without dead ends: 242 [2018-04-12 13:10:11,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:10:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-12 13:10:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 210. [2018-04-12 13:10:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-12 13:10:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 241 transitions. [2018-04-12 13:10:11,236 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 241 transitions. Word has length 24 [2018-04-12 13:10:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:11,236 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 241 transitions. [2018-04-12 13:10:11,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:10:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 241 transitions. [2018-04-12 13:10:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 13:10:11,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:11,237 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:11,239 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash -690724340, now seen corresponding path program 1 times [2018-04-12 13:10:11,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:11,239 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:11,240 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:11,240 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:11,249 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:11,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:11,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:10:11,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:10:11,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:10:11,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:11,271 INFO L87 Difference]: Start difference. First operand 210 states and 241 transitions. Second operand 5 states. [2018-04-12 13:10:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:11,466 INFO L93 Difference]: Finished difference Result 337 states and 388 transitions. [2018-04-12 13:10:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:10:11,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 13:10:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:11,468 INFO L225 Difference]: With dead ends: 337 [2018-04-12 13:10:11,468 INFO L226 Difference]: Without dead ends: 337 [2018-04-12 13:10:11,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:10:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-12 13:10:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 209. [2018-04-12 13:10:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-12 13:10:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2018-04-12 13:10:11,473 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 25 [2018-04-12 13:10:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:11,473 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2018-04-12 13:10:11,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:10:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2018-04-12 13:10:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 13:10:11,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:11,474 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:11,474 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -690724339, now seen corresponding path program 1 times [2018-04-12 13:10:11,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:11,474 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:11,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:11,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:11,484 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:11,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:11,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:10:11,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:10:11,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:10:11,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:11,519 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 5 states. [2018-04-12 13:10:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:11,718 INFO L93 Difference]: Finished difference Result 372 states and 423 transitions. [2018-04-12 13:10:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:10:11,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 13:10:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:11,719 INFO L225 Difference]: With dead ends: 372 [2018-04-12 13:10:11,719 INFO L226 Difference]: Without dead ends: 372 [2018-04-12 13:10:11,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:10:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-12 13:10:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 208. [2018-04-12 13:10:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-12 13:10:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 237 transitions. [2018-04-12 13:10:11,724 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 237 transitions. Word has length 25 [2018-04-12 13:10:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:11,724 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 237 transitions. [2018-04-12 13:10:11,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:10:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 237 transitions. [2018-04-12 13:10:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 13:10:11,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:11,725 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:11,725 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash -96046116, now seen corresponding path program 1 times [2018-04-12 13:10:11,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:11,725 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:11,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:11,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:11,734 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:11,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:11,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:10:11,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:10:11,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:10:11,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:10:11,754 INFO L87 Difference]: Start difference. First operand 208 states and 237 transitions. Second operand 4 states. [2018-04-12 13:10:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:11,912 INFO L93 Difference]: Finished difference Result 256 states and 289 transitions. [2018-04-12 13:10:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:10:11,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-04-12 13:10:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:11,913 INFO L225 Difference]: With dead ends: 256 [2018-04-12 13:10:11,913 INFO L226 Difference]: Without dead ends: 256 [2018-04-12 13:10:11,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-12 13:10:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 211. [2018-04-12 13:10:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-12 13:10:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2018-04-12 13:10:11,916 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 27 [2018-04-12 13:10:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:11,916 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2018-04-12 13:10:11,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:10:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2018-04-12 13:10:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 13:10:11,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:11,917 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:11,917 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:11,917 INFO L82 PathProgramCache]: Analyzing trace with hash -96046115, now seen corresponding path program 1 times [2018-04-12 13:10:11,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:11,917 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:11,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:11,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:11,925 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 13:10:12,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:12,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 13:10:12,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 13:10:12,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 13:10:12,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:10:12,006 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand 8 states. [2018-04-12 13:10:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:12,265 INFO L93 Difference]: Finished difference Result 325 states and 361 transitions. [2018-04-12 13:10:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 13:10:12,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-04-12 13:10:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:12,266 INFO L225 Difference]: With dead ends: 325 [2018-04-12 13:10:12,266 INFO L226 Difference]: Without dead ends: 325 [2018-04-12 13:10:12,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-12 13:10:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-12 13:10:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2018-04-12 13:10:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-12 13:10:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2018-04-12 13:10:12,271 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 27 [2018-04-12 13:10:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:12,271 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2018-04-12 13:10:12,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 13:10:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2018-04-12 13:10:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 13:10:12,272 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:12,272 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:12,272 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash -95986534, now seen corresponding path program 1 times [2018-04-12 13:10:12,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:12,273 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:12,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:12,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:12,281 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:12,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:12,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 13:10:12,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 13:10:12,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 13:10:12,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 13:10:12,358 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand 7 states. [2018-04-12 13:10:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:12,532 INFO L93 Difference]: Finished difference Result 351 states and 390 transitions. [2018-04-12 13:10:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:10:12,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-12 13:10:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:12,534 INFO L225 Difference]: With dead ends: 351 [2018-04-12 13:10:12,534 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 13:10:12,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-04-12 13:10:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 13:10:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 227. [2018-04-12 13:10:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-04-12 13:10:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2018-04-12 13:10:12,537 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 27 [2018-04-12 13:10:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:12,537 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2018-04-12 13:10:12,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 13:10:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2018-04-12 13:10:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:10:12,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:12,538 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:12,538 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1317536726, now seen corresponding path program 1 times [2018-04-12 13:10:12,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:12,538 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:12,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:12,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:12,545 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:12,573 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-12 13:10:12,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:12,573 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-12 13:10:12,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:12,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:12,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:12,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:12,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-12 13:10:12,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:12,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:12,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-12 13:10:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 13:10:12,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 13:10:12,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-04-12 13:10:12,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 13:10:12,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 13:10:12,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-12 13:10:12,712 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand 10 states. [2018-04-12 13:10:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:13,035 INFO L93 Difference]: Finished difference Result 350 states and 388 transitions. [2018-04-12 13:10:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 13:10:13,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-04-12 13:10:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:13,036 INFO L225 Difference]: With dead ends: 350 [2018-04-12 13:10:13,036 INFO L226 Difference]: Without dead ends: 350 [2018-04-12 13:10:13,037 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-04-12 13:10:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-12 13:10:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 225. [2018-04-12 13:10:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-12 13:10:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 257 transitions. [2018-04-12 13:10:13,042 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 257 transitions. Word has length 28 [2018-04-12 13:10:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:13,042 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 257 transitions. [2018-04-12 13:10:13,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 13:10:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 257 transitions. [2018-04-12 13:10:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:10:13,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:13,043 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:13,043 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -180443154, now seen corresponding path program 1 times [2018-04-12 13:10:13,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:13,043 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:13,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:13,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:13,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:13,053 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:13,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-12 13:10:13,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:13,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:10:13,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:10:13,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:10:13,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:10:13,135 INFO L87 Difference]: Start difference. First operand 225 states and 257 transitions. Second operand 9 states. [2018-04-12 13:10:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:13,601 INFO L93 Difference]: Finished difference Result 284 states and 324 transitions. [2018-04-12 13:10:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:10:13,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-12 13:10:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:13,602 INFO L225 Difference]: With dead ends: 284 [2018-04-12 13:10:13,602 INFO L226 Difference]: Without dead ends: 284 [2018-04-12 13:10:13,603 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-12 13:10:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-12 13:10:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 224. [2018-04-12 13:10:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-12 13:10:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 255 transitions. [2018-04-12 13:10:13,606 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 255 transitions. Word has length 28 [2018-04-12 13:10:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:13,606 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 255 transitions. [2018-04-12 13:10:13,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:10:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 255 transitions. [2018-04-12 13:10:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:10:13,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:13,607 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:13,607 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -180443153, now seen corresponding path program 1 times [2018-04-12 13:10:13,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:13,607 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:13,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:13,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:13,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:13,615 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:13,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:13,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:10:13,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:10:13,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:10:13,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:10:13,707 INFO L87 Difference]: Start difference. First operand 224 states and 255 transitions. Second operand 9 states. [2018-04-12 13:10:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:14,080 INFO L93 Difference]: Finished difference Result 283 states and 322 transitions. [2018-04-12 13:10:14,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:10:14,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-12 13:10:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:14,081 INFO L225 Difference]: With dead ends: 283 [2018-04-12 13:10:14,081 INFO L226 Difference]: Without dead ends: 283 [2018-04-12 13:10:14,081 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-12 13:10:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-12 13:10:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 223. [2018-04-12 13:10:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-12 13:10:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2018-04-12 13:10:14,084 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 28 [2018-04-12 13:10:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:14,084 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2018-04-12 13:10:14,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:10:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2018-04-12 13:10:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 13:10:14,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:14,085 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:14,085 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1227873623, now seen corresponding path program 1 times [2018-04-12 13:10:14,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:14,085 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:14,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:14,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:14,093 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:14,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:14,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:10:14,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:10:14,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:10:14,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:14,115 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand 5 states. [2018-04-12 13:10:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:14,282 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-04-12 13:10:14,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:10:14,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 13:10:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:14,283 INFO L225 Difference]: With dead ends: 353 [2018-04-12 13:10:14,283 INFO L226 Difference]: Without dead ends: 353 [2018-04-12 13:10:14,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:10:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-12 13:10:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 222. [2018-04-12 13:10:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-12 13:10:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 251 transitions. [2018-04-12 13:10:14,286 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 251 transitions. Word has length 29 [2018-04-12 13:10:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:14,286 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 251 transitions. [2018-04-12 13:10:14,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:10:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 251 transitions. [2018-04-12 13:10:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 13:10:14,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:14,286 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:14,286 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1227873622, now seen corresponding path program 1 times [2018-04-12 13:10:14,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:14,287 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:14,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:14,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:14,294 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:14,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:14,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:10:14,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:10:14,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:10:14,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:10:14,344 INFO L87 Difference]: Start difference. First operand 222 states and 251 transitions. Second operand 5 states. [2018-04-12 13:10:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:14,649 INFO L93 Difference]: Finished difference Result 388 states and 439 transitions. [2018-04-12 13:10:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:10:14,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 13:10:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:14,651 INFO L225 Difference]: With dead ends: 388 [2018-04-12 13:10:14,651 INFO L226 Difference]: Without dead ends: 388 [2018-04-12 13:10:14,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:10:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-12 13:10:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 221. [2018-04-12 13:10:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-12 13:10:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 249 transitions. [2018-04-12 13:10:14,656 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 249 transitions. Word has length 29 [2018-04-12 13:10:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:14,656 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 249 transitions. [2018-04-12 13:10:14,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:10:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 249 transitions. [2018-04-12 13:10:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:10:14,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:14,657 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:14,657 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:14,657 INFO L82 PathProgramCache]: Analyzing trace with hash 653445651, now seen corresponding path program 1 times [2018-04-12 13:10:14,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:14,657 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:14,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:14,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:14,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:14,669 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:14,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:14,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:10:14,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:10:14,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:10:14,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:10:14,741 INFO L87 Difference]: Start difference. First operand 221 states and 249 transitions. Second operand 9 states. [2018-04-12 13:10:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:15,014 INFO L93 Difference]: Finished difference Result 250 states and 281 transitions. [2018-04-12 13:10:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:10:15,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 13:10:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:15,015 INFO L225 Difference]: With dead ends: 250 [2018-04-12 13:10:15,015 INFO L226 Difference]: Without dead ends: 250 [2018-04-12 13:10:15,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-12 13:10:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-12 13:10:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 220. [2018-04-12 13:10:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-12 13:10:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2018-04-12 13:10:15,018 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 32 [2018-04-12 13:10:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:15,018 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2018-04-12 13:10:15,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:10:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2018-04-12 13:10:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:10:15,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:15,019 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:15,019 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash 653445652, now seen corresponding path program 1 times [2018-04-12 13:10:15,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:15,019 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:15,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:15,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:15,029 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:15,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:10:15,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:10:15,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:10:15,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:10:15,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:10:15,107 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 9 states. [2018-04-12 13:10:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:15,439 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2018-04-12 13:10:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:10:15,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 13:10:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:15,440 INFO L225 Difference]: With dead ends: 249 [2018-04-12 13:10:15,440 INFO L226 Difference]: Without dead ends: 249 [2018-04-12 13:10:15,440 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-12 13:10:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-12 13:10:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 219. [2018-04-12 13:10:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-12 13:10:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 247 transitions. [2018-04-12 13:10:15,442 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 247 transitions. Word has length 32 [2018-04-12 13:10:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:15,442 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 247 transitions. [2018-04-12 13:10:15,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:10:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 247 transitions. [2018-04-12 13:10:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 13:10:15,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:15,442 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:15,443 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash -983866550, now seen corresponding path program 1 times [2018-04-12 13:10:15,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:15,443 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:15,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:15,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:15,450 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:15,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:15,567 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-12 13:10:15,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:15,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:15,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:15,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:15,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:15,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:15,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-12 13:10:15,641 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 27 treesize of output 20 [2018-04-12 13:10:15,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:15,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-12 13:10:15,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,654 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 27 treesize of output 20 [2018-04-12 13:10:15,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:15,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-12 13:10:15,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-12 13:10:15,693 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 36 treesize of output 27 [2018-04-12 13:10:15,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:15,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:10:15,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,708 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 36 treesize of output 27 [2018-04-12 13:10:15,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:15,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:10:15,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:15 [2018-04-12 13:10:15,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:10:15,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:10:15,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:10:15,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:10:15,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:15,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-12 13:10:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:15,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:10:15,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-04-12 13:10:15,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 13:10:15,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 13:10:15,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-12 13:10:15,777 INFO L87 Difference]: Start difference. First operand 219 states and 247 transitions. Second operand 17 states. [2018-04-12 13:10:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:16,348 INFO L93 Difference]: Finished difference Result 361 states and 409 transitions. [2018-04-12 13:10:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 13:10:16,375 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-04-12 13:10:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:16,376 INFO L225 Difference]: With dead ends: 361 [2018-04-12 13:10:16,376 INFO L226 Difference]: Without dead ends: 361 [2018-04-12 13:10:16,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 13:10:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-12 13:10:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 292. [2018-04-12 13:10:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-12 13:10:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 343 transitions. [2018-04-12 13:10:16,380 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 343 transitions. Word has length 37 [2018-04-12 13:10:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:16,380 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 343 transitions. [2018-04-12 13:10:16,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 13:10:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2018-04-12 13:10:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 13:10:16,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:16,380 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:16,380 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2133144070, now seen corresponding path program 2 times [2018-04-12 13:10:16,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:16,381 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:16,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:16,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:16,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:16,388 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:16,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:16,567 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-12 13:10:16,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 13:10:16,615 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 13:10:16,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 13:10:16,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:16,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:10:16,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 13:10:16,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:16,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:16,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-12 13:10:16,772 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 29 treesize of output 22 [2018-04-12 13:10:16,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:16,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-04-12 13:10:16,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-12 13:10:16,810 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 38 treesize of output 29 [2018-04-12 13:10:16,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:16,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-12 13:10:16,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:13 [2018-04-12 13:10:16,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-12 13:10:16,867 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 13 treesize of output 5 [2018-04-12 13:10:16,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:16,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-04-12 13:10:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:16,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:10:16,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2018-04-12 13:10:16,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 13:10:16,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 13:10:16,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-04-12 13:10:16,915 INFO L87 Difference]: Start difference. First operand 292 states and 343 transitions. Second operand 25 states. [2018-04-12 13:10:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:18,171 INFO L93 Difference]: Finished difference Result 437 states and 500 transitions. [2018-04-12 13:10:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 13:10:18,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-04-12 13:10:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:18,172 INFO L225 Difference]: With dead ends: 437 [2018-04-12 13:10:18,172 INFO L226 Difference]: Without dead ends: 437 [2018-04-12 13:10:18,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=420, Invalid=2336, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 13:10:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-12 13:10:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 322. [2018-04-12 13:10:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-04-12 13:10:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 376 transitions. [2018-04-12 13:10:18,176 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 376 transitions. Word has length 47 [2018-04-12 13:10:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:18,176 INFO L459 AbstractCegarLoop]: Abstraction has 322 states and 376 transitions. [2018-04-12 13:10:18,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 13:10:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 376 transitions. [2018-04-12 13:10:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 13:10:18,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:18,176 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:18,176 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2133144069, now seen corresponding path program 1 times [2018-04-12 13:10:18,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:18,177 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:18,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:18,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 13:10:18,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:18,184 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:18,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:18,338 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-12 13:10:18,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:18,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:18,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:18,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:18,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:18,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:18,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-12 13:10:18,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 13:10:18,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:10:18,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 13:10:18,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:10:18,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:32 [2018-04-12 13:10:18,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:10:18,519 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 23 treesize of output 25 [2018-04-12 13:10:18,521 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 25 treesize of output 13 [2018-04-12 13:10:18,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,531 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 23 treesize of output 26 [2018-04-12 13:10:18,536 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 26 treesize of output 14 [2018-04-12 13:10:18,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:26 [2018-04-12 13:10:18,673 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 34 treesize of output 25 [2018-04-12 13:10:18,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-04-12 13:10:18,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,688 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 27 treesize of output 20 [2018-04-12 13:10:18,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-12 13:10:18,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:52 [2018-04-12 13:10:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-12 13:10:18,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:10:18,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-04-12 13:10:18,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:18,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:10:18,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:22 [2018-04-12 13:10:18,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:10:18,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:10:18,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:10:18,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:10:18,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:18,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-04-12 13:10:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:18,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:10:18,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-04-12 13:10:18,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 13:10:18,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 13:10:18,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-04-12 13:10:18,929 INFO L87 Difference]: Start difference. First operand 322 states and 376 transitions. Second operand 28 states. [2018-04-12 13:10:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:20,058 INFO L93 Difference]: Finished difference Result 522 states and 588 transitions. [2018-04-12 13:10:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 13:10:20,058 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-04-12 13:10:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:20,059 INFO L225 Difference]: With dead ends: 522 [2018-04-12 13:10:20,059 INFO L226 Difference]: Without dead ends: 522 [2018-04-12 13:10:20,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=410, Invalid=3622, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 13:10:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-04-12 13:10:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 344. [2018-04-12 13:10:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-04-12 13:10:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 398 transitions. [2018-04-12 13:10:20,064 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 398 transitions. Word has length 47 [2018-04-12 13:10:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:20,065 INFO L459 AbstractCegarLoop]: Abstraction has 344 states and 398 transitions. [2018-04-12 13:10:20,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 13:10:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 398 transitions. [2018-04-12 13:10:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:10:20,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:20,065 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:20,065 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1702957704, now seen corresponding path program 1 times [2018-04-12 13:10:20,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:20,066 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:20,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:20,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:20,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:20,075 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-12 13:10:20,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:20,106 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-12 13:10:20,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:20,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-04-12 13:10:20,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:10:20,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-04-12 13:10:20,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:10:20,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:10:20,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:10:20,165 INFO L87 Difference]: Start difference. First operand 344 states and 398 transitions. Second operand 4 states. [2018-04-12 13:10:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:20,217 INFO L93 Difference]: Finished difference Result 442 states and 502 transitions. [2018-04-12 13:10:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:10:20,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-04-12 13:10:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:20,218 INFO L225 Difference]: With dead ends: 442 [2018-04-12 13:10:20,218 INFO L226 Difference]: Without dead ends: 442 [2018-04-12 13:10:20,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:10:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-12 13:10:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 347. [2018-04-12 13:10:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-12 13:10:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 402 transitions. [2018-04-12 13:10:20,221 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 402 transitions. Word has length 48 [2018-04-12 13:10:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:20,221 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 402 transitions. [2018-04-12 13:10:20,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:10:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 402 transitions. [2018-04-12 13:10:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:10:20,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:20,222 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:20,222 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:10:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1219994781, now seen corresponding path program 1 times [2018-04-12 13:10:20,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:20,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:20,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:20,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:20,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:20,230 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:20,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:20,344 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-12 13:10:20,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:20,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:20,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:20,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:20,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:10:20,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:10:20,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-12 13:10:20,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:20,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:20,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:10:20,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2018-04-12 13:10:20,460 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-12 13:10:20,475 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-12 13:10:20,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 13:10:20,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:10:20,517 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-12 13:10:20,519 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 16 treesize of output 17 [2018-04-12 13:10:20,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,538 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-12 13:10:20,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:105 [2018-04-12 13:10:20,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:20,629 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 92 treesize of output 88 [2018-04-12 13:10:20,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:10:20,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:20,678 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 79 treesize of output 75 [2018-04-12 13:10:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:10:20,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,724 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 84 treesize of output 77 [2018-04-12 13:10:20,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:10:20,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,767 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 71 treesize of output 64 [2018-04-12 13:10:20,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:10:20,768 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,798 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-12 13:10:20,798 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:172, output treesize:140 [2018-04-12 13:10:20,930 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 115 treesize of output 105 [2018-04-12 13:10:20,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:10:20,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,980 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 107 treesize of output 94 [2018-04-12 13:10:20,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:10:20,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:20,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:21,025 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 115 treesize of output 101 [2018-04-12 13:10:21,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:10:21,027 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:21,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:21,064 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 105 treesize of output 88 [2018-04-12 13:10:21,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:10:21,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:21,075 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:21,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 13:10:21,097 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:231, output treesize:195 [2018-04-12 13:10:25,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 93 treesize of output 81 [2018-04-12 13:10:25,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:10:25,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 13:10:25,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:10:25,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,365 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 123 treesize of output 105 [2018-04-12 13:10:25,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 13:10:25,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:10:25,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-12 13:10:25,384 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 13:10:25,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:217, output treesize:138 [2018-04-12 13:10:25,642 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 56 treesize of output 40 [2018-04-12 13:10:25,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:10:25,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,647 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 33 treesize of output 14 [2018-04-12 13:10:25,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:25,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:10:25,654 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:19 [2018-04-12 13:10:25,725 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-12 13:10:25,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:10:25,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 29 [2018-04-12 13:10:25,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:10:25,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:10:25,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=723, Unknown=2, NotChecked=0, Total=812 [2018-04-12 13:10:25,760 INFO L87 Difference]: Start difference. First operand 347 states and 402 transitions. Second operand 29 states. [2018-04-12 13:11:05,312 WARN L151 SmtUtils]: Spent 10094ms on a formula simplification. DAG size of input: 161 DAG size of output 61 [2018-04-12 13:11:21,478 WARN L151 SmtUtils]: Spent 10080ms on a formula simplification. DAG size of input: 147 DAG size of output 57 [2018-04-12 13:11:31,648 WARN L151 SmtUtils]: Spent 10092ms on a formula simplification. DAG size of input: 151 DAG size of output 61 [2018-04-12 13:11:41,748 WARN L151 SmtUtils]: Spent 9850ms on a formula simplification. DAG size of input: 166 DAG size of output 67 [2018-04-12 13:11:51,589 WARN L151 SmtUtils]: Spent 9758ms on a formula simplification. DAG size of input: 169 DAG size of output 65 [2018-04-12 13:12:03,840 WARN L151 SmtUtils]: Spent 12157ms on a formula simplification. DAG size of input: 175 DAG size of output 74 [2018-04-12 13:12:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:12:04,813 INFO L93 Difference]: Finished difference Result 430 states and 485 transitions. [2018-04-12 13:12:04,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 13:12:04,813 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-12 13:12:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:12:04,814 INFO L225 Difference]: With dead ends: 430 [2018-04-12 13:12:04,814 INFO L226 Difference]: Without dead ends: 430 [2018-04-12 13:12:04,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 93.3s TimeCoverageRelationStatistics Valid=617, Invalid=2230, Unknown=15, NotChecked=0, Total=2862 [2018-04-12 13:12:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-12 13:12:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 348. [2018-04-12 13:12:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-12 13:12:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 393 transitions. [2018-04-12 13:12:04,818 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 393 transitions. Word has length 48 [2018-04-12 13:12:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:12:04,818 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 393 transitions. [2018-04-12 13:12:04,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:12:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 393 transitions. [2018-04-12 13:12:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:12:04,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:12:04,819 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:12:04,819 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:12:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1534936733, now seen corresponding path program 1 times [2018-04-12 13:12:04,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:12:04,819 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:12:04,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:04,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:04,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:04,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:12:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:12:04,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:12:04,982 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-12 13:12:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:05,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:12:05,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:05,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:05,123 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-12 13:12:05,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-12 13:12:05,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 13:12:05,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:05,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:12:05,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 13:12:05,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:05,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:12:05,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-12 13:12:05,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:05,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-12 13:12:05,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:12:05,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,282 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-12 13:12:05,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:12:05,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:05,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:72 [2018-04-12 13:12:05,388 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-12 13:12:05,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:12:05,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,410 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 84 treesize of output 70 [2018-04-12 13:12:05,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:12:05,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:05,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:05,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:96 [2018-04-12 13:12:11,571 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-12 13:12:11,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:11,578 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-12 13:12:11,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:11,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:12:11,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:11,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:11,599 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-12 13:12:11,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:12:11,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:11,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:11,608 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-12 13:12:11,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:11,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:11,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:11,615 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-04-12 13:12:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:12:11,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:12:11,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-12 13:12:11,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:12:11,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:12:11,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2018-04-12 13:12:11,680 INFO L87 Difference]: Start difference. First operand 348 states and 393 transitions. Second operand 29 states. [2018-04-12 13:12:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:12:45,160 INFO L93 Difference]: Finished difference Result 507 states and 580 transitions. [2018-04-12 13:12:45,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 13:12:45,161 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-12 13:12:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:12:45,161 INFO L225 Difference]: With dead ends: 507 [2018-04-12 13:12:45,161 INFO L226 Difference]: Without dead ends: 507 [2018-04-12 13:12:45,162 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=571, Invalid=1866, Unknown=13, NotChecked=0, Total=2450 [2018-04-12 13:12:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-04-12 13:12:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 403. [2018-04-12 13:12:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-12 13:12:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 463 transitions. [2018-04-12 13:12:45,166 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 463 transitions. Word has length 48 [2018-04-12 13:12:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:12:45,166 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 463 transitions. [2018-04-12 13:12:45,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:12:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 463 transitions. [2018-04-12 13:12:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 13:12:45,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:12:45,166 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:12:45,166 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:12:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -654315171, now seen corresponding path program 1 times [2018-04-12 13:12:45,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:12:45,166 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:12:45,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:45,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:45,174 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:12:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-12 13:12:45,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:12:45,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:12:45,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:12:45,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:12:45,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:12:45,190 INFO L87 Difference]: Start difference. First operand 403 states and 463 transitions. Second operand 4 states. [2018-04-12 13:12:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:12:45,270 INFO L93 Difference]: Finished difference Result 417 states and 478 transitions. [2018-04-12 13:12:45,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:12:45,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-04-12 13:12:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:12:45,271 INFO L225 Difference]: With dead ends: 417 [2018-04-12 13:12:45,271 INFO L226 Difference]: Without dead ends: 417 [2018-04-12 13:12:45,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:12:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-12 13:12:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 404. [2018-04-12 13:12:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-04-12 13:12:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 466 transitions. [2018-04-12 13:12:45,275 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 466 transitions. Word has length 51 [2018-04-12 13:12:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:12:45,276 INFO L459 AbstractCegarLoop]: Abstraction has 404 states and 466 transitions. [2018-04-12 13:12:45,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:12:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 466 transitions. [2018-04-12 13:12:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 13:12:45,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:12:45,277 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:12:45,277 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:12:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash -654315170, now seen corresponding path program 1 times [2018-04-12 13:12:45,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:12:45,277 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:12:45,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:45,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:45,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:45,285 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:12:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-12 13:12:45,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:12:45,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:12:45,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:12:45,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:12:45,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:12:45,308 INFO L87 Difference]: Start difference. First operand 404 states and 466 transitions. Second operand 4 states. [2018-04-12 13:12:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:12:45,414 INFO L93 Difference]: Finished difference Result 408 states and 468 transitions. [2018-04-12 13:12:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:12:45,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-04-12 13:12:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:12:45,415 INFO L225 Difference]: With dead ends: 408 [2018-04-12 13:12:45,415 INFO L226 Difference]: Without dead ends: 408 [2018-04-12 13:12:45,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:12:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-12 13:12:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 402. [2018-04-12 13:12:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-12 13:12:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 463 transitions. [2018-04-12 13:12:45,419 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 463 transitions. Word has length 51 [2018-04-12 13:12:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:12:45,419 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 463 transitions. [2018-04-12 13:12:45,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:12:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 463 transitions. [2018-04-12 13:12:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 13:12:45,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:12:45,420 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:12:45,420 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:12:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1994549109, now seen corresponding path program 1 times [2018-04-12 13:12:45,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:12:45,421 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:12:45,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:45,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:45,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:45,441 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:12:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:12:45,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:12:45,633 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-12 13:12:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:45,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:12:45,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:45,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:45,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:12:45,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 13:12:45,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:12:45,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 8 treesize of output 7 [2018-04-12 13:12:45,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:12:45,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:12:45,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 13:12:45,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:45,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 13:12:45,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:12:45,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:45,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2018-04-12 13:12:45,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:12:45,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:45,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2018-04-12 13:12:45,819 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 82 treesize of output 72 [2018-04-12 13:12:45,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:12:45,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 13:12:45,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:12:45,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:45,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:45,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:78 [2018-04-12 13:12:49,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-04-12 13:12:49,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:49,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:64 [2018-04-12 13:12:49,965 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-12 13:12:49,967 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-12 13:12:49,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:12:49,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-12 13:12:49,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:12:49,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:12:49,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:49,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:12:49,994 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:78, output treesize:26 [2018-04-12 13:12:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:12:50,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:12:50,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-04-12 13:12:50,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:12:50,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:12:50,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=683, Unknown=2, NotChecked=0, Total=812 [2018-04-12 13:12:50,155 INFO L87 Difference]: Start difference. First operand 402 states and 463 transitions. Second operand 29 states. [2018-04-12 13:13:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:13:24,342 INFO L93 Difference]: Finished difference Result 911 states and 1085 transitions. [2018-04-12 13:13:24,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 13:13:24,342 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-04-12 13:13:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:13:24,344 INFO L225 Difference]: With dead ends: 911 [2018-04-12 13:13:24,344 INFO L226 Difference]: Without dead ends: 911 [2018-04-12 13:13:24,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=649, Invalid=2306, Unknown=15, NotChecked=0, Total=2970 [2018-04-12 13:13:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-04-12 13:13:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 508. [2018-04-12 13:13:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-04-12 13:13:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 609 transitions. [2018-04-12 13:13:24,351 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 609 transitions. Word has length 51 [2018-04-12 13:13:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:13:24,351 INFO L459 AbstractCegarLoop]: Abstraction has 508 states and 609 transitions. [2018-04-12 13:13:24,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:13:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 609 transitions. [2018-04-12 13:13:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 13:13:24,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:13:24,352 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:13:24,352 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:13:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1994549110, now seen corresponding path program 1 times [2018-04-12 13:13:24,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:13:24,352 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:13:24,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:13:24,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:13:24,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:13:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:13:24,358 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:13:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:13:24,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:13:24,604 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-12 13:13:24,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:13:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:13:24,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:13:24,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:13:24,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:24,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:24,651 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-12 13:13:24,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 13:13:24,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:13:24,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:13:24,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:13:24,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:13:24,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 13:13:24,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:24,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-04-12 13:13:24,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:13:24,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:24,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 13:13:24,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 12 treesize of output 11 [2018-04-12 13:13:24,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:24,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-12 13:13:24,835 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 82 treesize of output 72 [2018-04-12 13:13:24,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:13:24,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 13:13:24,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 20 treesize of output 25 [2018-04-12 13:13:24,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:24,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:24,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-12 13:13:28,919 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 15 [2018-04-12 13:13:28,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:28,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:28,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:59 [2018-04-12 13:13:28,988 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-12 13:13:28,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:13:28,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:28,995 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-12 13:13:28,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:28,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:29,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-12 13:13:29,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:13:29,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:29,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:13:29,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:29,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:29,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:29,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:73, output treesize:17 [2018-04-12 13:13:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:13:29,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:13:29,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-04-12 13:13:29,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:13:29,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:13:29,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=712, Unknown=2, NotChecked=0, Total=812 [2018-04-12 13:13:29,124 INFO L87 Difference]: Start difference. First operand 508 states and 609 transitions. Second operand 29 states. [2018-04-12 13:13:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:13:30,964 INFO L93 Difference]: Finished difference Result 849 states and 997 transitions. [2018-04-12 13:13:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 13:13:30,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-04-12 13:13:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:13:30,965 INFO L225 Difference]: With dead ends: 849 [2018-04-12 13:13:30,965 INFO L226 Difference]: Without dead ends: 849 [2018-04-12 13:13:30,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=418, Invalid=2030, Unknown=2, NotChecked=0, Total=2450 [2018-04-12 13:13:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-04-12 13:13:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 514. [2018-04-12 13:13:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-04-12 13:13:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 615 transitions. [2018-04-12 13:13:30,970 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 615 transitions. Word has length 51 [2018-04-12 13:13:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:13:30,970 INFO L459 AbstractCegarLoop]: Abstraction has 514 states and 615 transitions. [2018-04-12 13:13:30,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:13:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 615 transitions. [2018-04-12 13:13:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 13:13:30,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:13:30,971 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:13:30,971 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:13:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash -73300619, now seen corresponding path program 1 times [2018-04-12 13:13:30,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:13:30,971 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:13:30,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:13:30,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:13:30,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:13:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:13:30,978 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:13:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:13:31,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:13:31,163 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-12 13:13:31,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:13:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:13:31,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:13:31,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:31,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:31,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:13:31,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-12 13:13:31,288 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-12 13:13:31,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:31,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:13:31,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,328 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-12 13:13:31,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:31,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:13:31,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-04-12 13:13:31,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:31,405 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-12 13:13:31,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:13:31,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,430 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-12 13:13:31,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:13:31,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:31,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-04-12 13:13:31,525 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 91 [2018-04-12 13:13:31,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:13:31,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,553 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-12 13:13:31,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:13:31,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:31,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:31,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-04-12 13:13:35,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-04-12 13:13:35,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:35,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:35,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:88 [2018-04-12 13:13:35,741 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 66 treesize of output 55 [2018-04-12 13:13:35,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:13:35,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:35,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:35,751 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 41 treesize of output 28 [2018-04-12 13:13:35,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:35,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:35,769 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-12 13:13:35,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:13:35,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:35,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:35,783 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-12 13:13:35,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:35,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:35,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:35,791 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:102, output treesize:29 [2018-04-12 13:13:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:13:35,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 13:13:35,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [16] total 28 [2018-04-12 13:13:35,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 13:13:35,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 13:13:35,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=639, Unknown=2, NotChecked=0, Total=756 [2018-04-12 13:13:35,901 INFO L87 Difference]: Start difference. First operand 514 states and 615 transitions. Second operand 28 states. [2018-04-12 13:13:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:13:57,560 INFO L93 Difference]: Finished difference Result 654 states and 767 transitions. [2018-04-12 13:13:57,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 13:13:57,561 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-04-12 13:13:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:13:57,562 INFO L225 Difference]: With dead ends: 654 [2018-04-12 13:13:57,562 INFO L226 Difference]: Without dead ends: 654 [2018-04-12 13:13:57,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=500, Invalid=2353, Unknown=9, NotChecked=0, Total=2862 [2018-04-12 13:13:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-04-12 13:13:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 506. [2018-04-12 13:13:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-12 13:13:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 597 transitions. [2018-04-12 13:13:57,567 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 597 transitions. Word has length 51 [2018-04-12 13:13:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:13:57,567 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 597 transitions. [2018-04-12 13:13:57,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 13:13:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 597 transitions. [2018-04-12 13:13:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:13:57,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:13:57,568 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:13:57,568 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:13:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash -221665623, now seen corresponding path program 1 times [2018-04-12 13:13:57,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:13:57,569 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:13:57,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:13:57,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:13:57,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:13:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:13:57,583 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:13:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:13:57,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:13:57,742 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-12 13:13:57,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:13:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:13:57,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:13:57,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:57,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:57,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:13:57,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 13:13:57,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:13:57,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:13:57,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-12 13:13:57,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:13:57,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-12 13:13:57,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:13:57,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:57,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-12 13:13:57,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 60 treesize of output 46 [2018-04-12 13:13:57,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-12 13:13:57,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:13:57,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:13:57,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 13:14:03,975 WARN L151 SmtUtils]: Spent 2014ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 13:14:08,018 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 40 treesize of output 33 [2018-04-12 13:14:08,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:14:08,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-12 13:14:08,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:08,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:14:08,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:08,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:14:08,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:14:08,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-12 13:14:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:14:08,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:14:08,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2018-04-12 13:14:08,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 13:14:08,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 13:14:08,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=558, Unknown=4, NotChecked=0, Total=702 [2018-04-12 13:14:08,105 INFO L87 Difference]: Start difference. First operand 506 states and 597 transitions. Second operand 27 states. [2018-04-12 13:15:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:15:05,360 INFO L93 Difference]: Finished difference Result 1022 states and 1224 transitions. [2018-04-12 13:15:05,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 13:15:05,361 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-04-12 13:15:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:15:05,362 INFO L225 Difference]: With dead ends: 1022 [2018-04-12 13:15:05,362 INFO L226 Difference]: Without dead ends: 1022 [2018-04-12 13:15:05,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=544, Invalid=1500, Unknown=26, NotChecked=0, Total=2070 [2018-04-12 13:15:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-04-12 13:15:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 553. [2018-04-12 13:15:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-12 13:15:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 667 transitions. [2018-04-12 13:15:05,368 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 667 transitions. Word has length 56 [2018-04-12 13:15:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:15:05,369 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 667 transitions. [2018-04-12 13:15:05,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 13:15:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 667 transitions. [2018-04-12 13:15:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:15:05,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:15:05,369 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:15:05,369 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:15:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash -221665622, now seen corresponding path program 1 times [2018-04-12 13:15:05,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:15:05,370 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:15:05,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:15:05,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:15:05,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:15:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:15:05,381 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:15:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:15:05,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:15:05,563 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-12 13:15:05,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:15:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:15:05,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:15:05,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:05,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:05,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 13:15:05,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:15:05,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-12 13:15:05,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:15:05,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:15:05,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:15:05,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:15:05,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-12 13:15:05,671 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-12 13:15:05,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:15:05,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,686 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-12 13:15:05,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:15:05,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:05,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:66 [2018-04-12 13:15:05,743 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-12 13:15:05,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:15:05,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2018-04-12 13:15:05,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:15:05,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:05,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:05,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-12 13:15:11,830 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-12 13:15:11,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:15:11,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,836 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-12 13:15:11,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-12 13:15:11,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:15:11,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:15:11,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:11,853 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-12 13:15:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:15:11,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:15:11,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-04-12 13:15:11,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 13:15:11,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 13:15:11,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2018-04-12 13:15:11,888 INFO L87 Difference]: Start difference. First operand 553 states and 667 transitions. Second operand 21 states. [2018-04-12 13:15:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:15:13,007 INFO L93 Difference]: Finished difference Result 961 states and 1146 transitions. [2018-04-12 13:15:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 13:15:13,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-12 13:15:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:15:13,011 INFO L225 Difference]: With dead ends: 961 [2018-04-12 13:15:13,011 INFO L226 Difference]: Without dead ends: 961 [2018-04-12 13:15:13,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=365, Invalid=1038, Unknown=3, NotChecked=0, Total=1406 [2018-04-12 13:15:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-04-12 13:15:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 587. [2018-04-12 13:15:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-04-12 13:15:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 709 transitions. [2018-04-12 13:15:13,018 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 709 transitions. Word has length 56 [2018-04-12 13:15:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:15:13,018 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 709 transitions. [2018-04-12 13:15:13,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 13:15:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 709 transitions. [2018-04-12 13:15:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:15:13,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:15:13,019 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:15:13,019 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:15:13,019 INFO L82 PathProgramCache]: Analyzing trace with hash -227391261, now seen corresponding path program 1 times [2018-04-12 13:15:13,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:15:13,019 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:15:13,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:15:13,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:15:13,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:15:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:15:13,029 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:15:13,198 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-12 13:15:13,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:15:13,199 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-12 13:15:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:15:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:15:13,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:15:13,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:13,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:13,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:15:13,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 13:15:13,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:15:13,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:15:13,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-12 13:15:13,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-12 13:15:13,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:15:13,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:13,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-12 13:15:13,325 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:15:13,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-12 13:15:13,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:15:13,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:13,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:13,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-12 13:15:19,370 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-04-12 13:15:19,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:19,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:19,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:19,376 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 46 [2018-04-12 13:15:19,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:19,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:59 [2018-04-12 13:15:19,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-04-12 13:15:19,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:19,415 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-12 13:15:19,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:19,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-04-12 13:15:19,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:19,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:19,519 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-12 13:15:19,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:15:19,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:19,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:90 [2018-04-12 13:15:19,628 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-12 13:15:19,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:15:19,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:19,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:19,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-04-12 13:15:25,695 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-12 13:15:27,737 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-12 13:15:27,739 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-12 13:15:27,740 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:27,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:15:27,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:27,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:15:27,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:27,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:27,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:27,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:28 [2018-04-12 13:15:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:15:27,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:15:27,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2018-04-12 13:15:27,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 13:15:27,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 13:15:27,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=739, Unknown=5, NotChecked=0, Total=930 [2018-04-12 13:15:27,914 INFO L87 Difference]: Start difference. First operand 587 states and 709 transitions. Second operand 31 states. [2018-04-12 13:15:42,378 WARN L151 SmtUtils]: Spent 2057ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-04-12 13:17:23,572 WARN L151 SmtUtils]: Spent 2060ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-12 13:18:09,058 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 31 DAG size of output 30 [2018-04-12 13:18:11,733 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 34 DAG size of output 33 [2018-04-12 13:18:11,890 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 39 DAG size of output 38 [2018-04-12 13:18:12,043 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 42 DAG size of output 41 [2018-04-12 13:18:12,387 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-04-12 13:18:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:18:12,394 INFO L93 Difference]: Finished difference Result 1993 states and 2439 transitions. [2018-04-12 13:18:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-12 13:18:12,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-04-12 13:18:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:18:12,398 INFO L225 Difference]: With dead ends: 1993 [2018-04-12 13:18:12,398 INFO L226 Difference]: Without dead ends: 1993 [2018-04-12 13:18:12,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3124 ImplicationChecksByTransitivity, 136.4s TimeCoverageRelationStatistics Valid=2026, Invalid=7418, Unknown=62, NotChecked=0, Total=9506 [2018-04-12 13:18:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2018-04-12 13:18:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 681. [2018-04-12 13:18:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-04-12 13:18:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 840 transitions. [2018-04-12 13:18:12,408 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 840 transitions. Word has length 56 [2018-04-12 13:18:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:18:12,408 INFO L459 AbstractCegarLoop]: Abstraction has 681 states and 840 transitions. [2018-04-12 13:18:12,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 13:18:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 840 transitions. [2018-04-12 13:18:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:18:12,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:18:12,409 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:18:12,409 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:18:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash -227391260, now seen corresponding path program 1 times [2018-04-12 13:18:12,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:18:12,409 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:18:12,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:12,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:12,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:12,420 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:18:12,642 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-12 13:18:12,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:18:12,642 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-12 13:18:12,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:12,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:18:12,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:12,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:12,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:18:12,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:18:12,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 13:18:12,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:18:12,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:18:12,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:18:12,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:18:12,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-04-12 13:18:12,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:12,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-04-12 13:18:12,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:18:12,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:12,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 13:18:12,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:18:12,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:12,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-12 13:18:12,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:18:12,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:12,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 54 [2018-04-12 13:18:12,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:18:12,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:18:12,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:12,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 84 [2018-04-12 13:18:12,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:18:12,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:12,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:12,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:93 [2018-04-12 13:18:16,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:16,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:16,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:16,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 13:18:16,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:16,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:18:16,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:17,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-04-12 13:18:17,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-12 13:18:17,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 78 [2018-04-12 13:18:17,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-12 13:18:17,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:18:17,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:17,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:92 [2018-04-12 13:18:17,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-04-12 13:18:17,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 14 treesize of output 13 [2018-04-12 13:18:17,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:17,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 133 [2018-04-12 13:18:17,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:18:17,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:17,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:118 [2018-04-12 13:18:17,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-04-12 13:18:17,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:18:17,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 134 [2018-04-12 13:18:17,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:18:17,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:17,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:17,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:142 [2018-04-12 13:18:23,495 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 116 treesize of output 91 [2018-04-12 13:18:23,506 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 70 treesize of output 47 [2018-04-12 13:18:23,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:23,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:23,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:23,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:23,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:23,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:23,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-04-12 13:18:23,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:18:23,558 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:23,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:23,565 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:23,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:23,568 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:23,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:23,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:23,575 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:130, output treesize:18 [2018-04-12 13:18:23,661 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-12 13:18:23,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:18:23,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-04-12 13:18:23,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 13:18:23,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 13:18:23,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=835, Unknown=5, NotChecked=0, Total=992 [2018-04-12 13:18:23,679 INFO L87 Difference]: Start difference. First operand 681 states and 840 transitions. Second operand 32 states. [2018-04-12 13:18:26,066 WARN L151 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-04-12 13:18:29,502 WARN L151 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 73 DAG size of output 59 [2018-04-12 13:18:33,048 WARN L151 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-04-12 13:18:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:18:33,575 INFO L93 Difference]: Finished difference Result 1724 states and 2102 transitions. [2018-04-12 13:18:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 13:18:33,575 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-12 13:18:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:18:33,578 INFO L225 Difference]: With dead ends: 1724 [2018-04-12 13:18:33,579 INFO L226 Difference]: Without dead ends: 1724 [2018-04-12 13:18:33,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1151, Invalid=5324, Unknown=5, NotChecked=0, Total=6480 [2018-04-12 13:18:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2018-04-12 13:18:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 695. [2018-04-12 13:18:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-04-12 13:18:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 859 transitions. [2018-04-12 13:18:33,586 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 859 transitions. Word has length 56 [2018-04-12 13:18:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:18:33,586 INFO L459 AbstractCegarLoop]: Abstraction has 695 states and 859 transitions. [2018-04-12 13:18:33,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 13:18:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 859 transitions. [2018-04-12 13:18:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 13:18:33,586 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:18:33,586 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:18:33,586 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:18:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -485378651, now seen corresponding path program 1 times [2018-04-12 13:18:33,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:18:33,587 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:18:33,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:33,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:33,592 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:18:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-12 13:18:33,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:18:33,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:18:33,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:18:33,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:18:33,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:18:33,617 INFO L87 Difference]: Start difference. First operand 695 states and 859 transitions. Second operand 4 states. [2018-04-12 13:18:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:18:33,692 INFO L93 Difference]: Finished difference Result 714 states and 879 transitions. [2018-04-12 13:18:33,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:18:33,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-04-12 13:18:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:18:33,694 INFO L225 Difference]: With dead ends: 714 [2018-04-12 13:18:33,694 INFO L226 Difference]: Without dead ends: 714 [2018-04-12 13:18:33,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:18:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-04-12 13:18:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 694. [2018-04-12 13:18:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-04-12 13:18:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 859 transitions. [2018-04-12 13:18:33,698 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 859 transitions. Word has length 57 [2018-04-12 13:18:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:18:33,698 INFO L459 AbstractCegarLoop]: Abstraction has 694 states and 859 transitions. [2018-04-12 13:18:33,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:18:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 859 transitions. [2018-04-12 13:18:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 13:18:33,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:18:33,699 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:18:33,699 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:18:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -485378650, now seen corresponding path program 1 times [2018-04-12 13:18:33,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:18:33,699 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:18:33,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:33,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:33,704 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:18:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-12 13:18:33,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:18:33,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:18:33,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:18:33,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:18:33,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:18:33,733 INFO L87 Difference]: Start difference. First operand 694 states and 859 transitions. Second operand 5 states. [2018-04-12 13:18:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:18:33,858 INFO L93 Difference]: Finished difference Result 725 states and 890 transitions. [2018-04-12 13:18:33,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:18:33,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-04-12 13:18:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:18:33,861 INFO L225 Difference]: With dead ends: 725 [2018-04-12 13:18:33,861 INFO L226 Difference]: Without dead ends: 725 [2018-04-12 13:18:33,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:18:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-12 13:18:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 696. [2018-04-12 13:18:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-04-12 13:18:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 860 transitions. [2018-04-12 13:18:33,868 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 860 transitions. Word has length 57 [2018-04-12 13:18:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:18:33,868 INFO L459 AbstractCegarLoop]: Abstraction has 696 states and 860 transitions. [2018-04-12 13:18:33,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:18:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 860 transitions. [2018-04-12 13:18:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 13:18:33,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:18:33,871 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:18:33,871 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:18:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2133221539, now seen corresponding path program 1 times [2018-04-12 13:18:33,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:18:33,871 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:18:33,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:33,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:33,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:18:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-12 13:18:33,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:18:33,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:18:33,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:18:33,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:18:33,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:18:33,889 INFO L87 Difference]: Start difference. First operand 696 states and 860 transitions. Second operand 4 states. [2018-04-12 13:18:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:18:33,904 INFO L93 Difference]: Finished difference Result 696 states and 859 transitions. [2018-04-12 13:18:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:18:33,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-04-12 13:18:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:18:33,907 INFO L225 Difference]: With dead ends: 696 [2018-04-12 13:18:33,907 INFO L226 Difference]: Without dead ends: 696 [2018-04-12 13:18:33,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:18:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-12 13:18:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2018-04-12 13:18:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-04-12 13:18:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 859 transitions. [2018-04-12 13:18:33,911 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 859 transitions. Word has length 58 [2018-04-12 13:18:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:18:33,911 INFO L459 AbstractCegarLoop]: Abstraction has 696 states and 859 transitions. [2018-04-12 13:18:33,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:18:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 859 transitions. [2018-04-12 13:18:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 13:18:33,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:18:33,912 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:18:33,912 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:18:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1132553751, now seen corresponding path program 1 times [2018-04-12 13:18:33,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:18:33,912 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:18:33,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:33,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:18:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:33,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:18:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:18:34,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:18:34,196 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:18:34,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:18:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:18:34,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:18:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:34,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:34,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:18:34,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 13:18:34,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:18:34,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:18:34,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:18:34,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:18:34,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2018-04-12 13:18:34,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-12 13:18:34,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:18:34,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 13:18:34,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 12 treesize of output 11 [2018-04-12 13:18:34,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:34,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:58 [2018-04-12 13:18:34,398 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:18:34,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2018-04-12 13:18:34,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:18:34,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,431 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:18:34,437 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 74 treesize of output 75 [2018-04-12 13:18:34,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:18:34,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:34,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:34,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:84 [2018-04-12 13:18:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,507 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 46 [2018-04-12 13:18:38,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:38,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:79 [2018-04-12 13:18:38,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-12 13:18:38,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:18:38,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-12 13:18:38,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 75 [2018-04-12 13:18:38,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:38,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:105, output treesize:97 [2018-04-12 13:18:38,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-04-12 13:18:38,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:18:38,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:18:38,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 133 [2018-04-12 13:18:38,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:18:38,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:38,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:123 [2018-04-12 13:18:38,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-04-12 13:18:38,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:18:38,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 134 [2018-04-12 13:18:38,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:18:38,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:38,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:38,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:167, output treesize:147 [2018-04-12 13:18:43,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 63 [2018-04-12 13:18:43,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:43,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:130, output treesize:129 [2018-04-12 13:18:43,122 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 116 treesize of output 91 [2018-04-12 13:18:43,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:43,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,134 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 70 treesize of output 47 [2018-04-12 13:18:43,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:43,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:43,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:43,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-04-12 13:18:43,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:43,163 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:18:43,169 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:18:43,172 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:18:43,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:18:43,179 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:143, output treesize:39 [2018-04-12 13:18:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:18:43,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:18:43,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-04-12 13:18:43,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 13:18:43,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 13:18:43,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1086, Unknown=4, NotChecked=0, Total=1332 [2018-04-12 13:18:43,478 INFO L87 Difference]: Start difference. First operand 696 states and 859 transitions. Second operand 37 states. [2018-04-12 13:19:00,046 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 56 DAG size of output 45 [2018-04-12 13:19:54,265 WARN L151 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 70 DAG size of output 59 [2018-04-12 13:20:29,243 WARN L151 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 82 DAG size of output 66 [2018-04-12 13:21:27,524 WARN L151 SmtUtils]: Spent 2125ms on a formula simplification. DAG size of input: 79 DAG size of output 63 [2018-04-12 13:22:41,761 WARN L151 SmtUtils]: Spent 2033ms on a formula simplification. DAG size of input: 68 DAG size of output 52 [2018-04-12 13:22:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:22:53,898 INFO L93 Difference]: Finished difference Result 2086 states and 2540 transitions. [2018-04-12 13:22:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-12 13:22:53,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 59 [2018-04-12 13:22:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:22:53,902 INFO L225 Difference]: With dead ends: 2086 [2018-04-12 13:22:53,902 INFO L226 Difference]: Without dead ends: 2086 [2018-04-12 13:22:53,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6204 ImplicationChecksByTransitivity, 224.6s TimeCoverageRelationStatistics Valid=3271, Invalid=14715, Unknown=104, NotChecked=0, Total=18090 [2018-04-12 13:22:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-04-12 13:22:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 710. [2018-04-12 13:22:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-04-12 13:22:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 875 transitions. [2018-04-12 13:22:53,912 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 875 transitions. Word has length 59 [2018-04-12 13:22:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:22:53,913 INFO L459 AbstractCegarLoop]: Abstraction has 710 states and 875 transitions. [2018-04-12 13:22:53,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 13:22:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 875 transitions. [2018-04-12 13:22:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 13:22:53,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:22:53,913 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:22:53,913 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:22:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1132553750, now seen corresponding path program 1 times [2018-04-12 13:22:53,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:22:53,913 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:22:53,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:22:53,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:22:53,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:22:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:22:53,922 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:22:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:22:54,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:22:54,343 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:22:54,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:22:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:22:54,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:22:54,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:22:54,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:54,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:54,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:22:54,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 13:22:54,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:22:54,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:22:54,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:22:54,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:22:54,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-04-12 13:22:54,457 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 65 treesize of output 61 [2018-04-12 13:22:54,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:22:54,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 13:22:54,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:22:54,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:22:54,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-12 13:22:54,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:22:54,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 92 [2018-04-12 13:22:54,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:22:54,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 13:22:54,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:22:54,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:54,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:22:54,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:93 [2018-04-12 13:22:58,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:22:58,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 13:22:58,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:22:58,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-04-12 13:22:58,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-04-12 13:22:58,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-04-12 13:22:58,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-12 13:22:58,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:22:58,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:22:58,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:92 [2018-04-12 13:22:58,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:22:58,841 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 125 treesize of output 135 [2018-04-12 13:22:58,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:22:58,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-04-12 13:22:58,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:22:58,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:58,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:22:58,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:118 [2018-04-12 13:22:59,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 144 [2018-04-12 13:22:59,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:22:59,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:59,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:59,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-04-12 13:22:59,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:22:59,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:22:59,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:22:59,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:22:59,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:142 [2018-04-12 13:23:03,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 40 [2018-04-12 13:23:03,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:23:03,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:125, output treesize:124 [2018-04-12 13:23:03,307 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 116 treesize of output 91 [2018-04-12 13:23:03,309 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 70 treesize of output 47 [2018-04-12 13:23:03,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:23:03,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:23:03,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:23:03,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:23:03,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-04-12 13:23:03,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:23:03,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:23:03,354 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:23:03,357 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:03,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:23:03,364 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:138, output treesize:26 [2018-04-12 13:23:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:23:03,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:23:03,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-04-12 13:23:03,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 13:23:03,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 13:23:03,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1184, Unknown=4, NotChecked=0, Total=1332 [2018-04-12 13:23:03,563 INFO L87 Difference]: Start difference. First operand 710 states and 875 transitions. Second operand 37 states. [2018-04-12 13:23:06,013 WARN L151 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 62 DAG size of output 51 [2018-04-12 13:23:10,329 WARN L151 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 74 DAG size of output 58 [2018-04-12 13:23:14,288 WARN L151 SmtUtils]: Spent 2037ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-04-12 13:23:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:23:14,969 INFO L93 Difference]: Finished difference Result 1664 states and 2004 transitions. [2018-04-12 13:23:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-12 13:23:14,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 59 [2018-04-12 13:23:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:23:14,972 INFO L225 Difference]: With dead ends: 1664 [2018-04-12 13:23:14,972 INFO L226 Difference]: Without dead ends: 1664 [2018-04-12 13:23:14,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3615 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1514, Invalid=9402, Unknown=4, NotChecked=0, Total=10920 [2018-04-12 13:23:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2018-04-12 13:23:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 678. [2018-04-12 13:23:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-04-12 13:23:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 835 transitions. [2018-04-12 13:23:14,979 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 835 transitions. Word has length 59 [2018-04-12 13:23:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:23:14,979 INFO L459 AbstractCegarLoop]: Abstraction has 678 states and 835 transitions. [2018-04-12 13:23:14,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 13:23:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 835 transitions. [2018-04-12 13:23:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 13:23:14,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:23:14,980 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:23:14,980 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:23:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1903066394, now seen corresponding path program 1 times [2018-04-12 13:23:14,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:23:14,980 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:23:14,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:23:14,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:23:14,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:23:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:23:14,990 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:23:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-12 13:23:15,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:23:15,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:23:15,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:23:15,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:23:15,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:23:15,029 INFO L87 Difference]: Start difference. First operand 678 states and 835 transitions. Second operand 5 states. [2018-04-12 13:23:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:23:15,158 INFO L93 Difference]: Finished difference Result 732 states and 898 transitions. [2018-04-12 13:23:15,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 13:23:15,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-04-12 13:23:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:23:15,160 INFO L225 Difference]: With dead ends: 732 [2018-04-12 13:23:15,160 INFO L226 Difference]: Without dead ends: 732 [2018-04-12 13:23:15,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-12 13:23:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-04-12 13:23:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 672. [2018-04-12 13:23:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-04-12 13:23:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 826 transitions. [2018-04-12 13:23:15,164 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 826 transitions. Word has length 61 [2018-04-12 13:23:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:23:15,164 INFO L459 AbstractCegarLoop]: Abstraction has 672 states and 826 transitions. [2018-04-12 13:23:15,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:23:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 826 transitions. [2018-04-12 13:23:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 13:23:15,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:23:15,165 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:23:15,165 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:23:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1903006813, now seen corresponding path program 2 times [2018-04-12 13:23:15,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:23:15,165 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:23:15,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:23:15,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:23:15,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:23:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:23:15,173 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:23:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:23:15,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:23:15,462 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:23:15,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 13:23:15,486 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 13:23:15,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 13:23:15,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:23:15,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:15,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:15,537 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-12 13:23:15,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-12 13:23:15,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:23:15,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:23:15,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:23:15,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:23:15,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-12 13:23:15,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:15,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2018-04-12 13:23:15,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 13:23:15,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:15,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2018-04-12 13:23:15,640 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 16 treesize of output 15 [2018-04-12 13:23:15,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-12 13:23:15,695 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 59 treesize of output 54 [2018-04-12 13:23:15,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-04-12 13:23:15,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,712 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 73 treesize of output 63 [2018-04-12 13:23:15,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-04-12 13:23:15,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:23:15,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:75 [2018-04-12 13:23:15,914 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 56 treesize of output 53 [2018-04-12 13:23:15,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-04-12 13:23:15,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,936 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 49 treesize of output 41 [2018-04-12 13:23:15,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-04-12 13:23:15,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:25 [2018-04-12 13:23:15,976 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 19 treesize of output 20 [2018-04-12 13:23:15,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:23:15,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,988 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 19 treesize of output 20 [2018-04-12 13:23:15,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:23:15,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:15,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:18 [2018-04-12 13:23:16,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:23:16,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:23:16,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:16,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:16,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:23:16,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:23:16,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:16,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:16,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:16,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-04-12 13:23:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:23:16,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:23:16,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2018-04-12 13:23:16,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 13:23:16,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 13:23:16,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 13:23:16,085 INFO L87 Difference]: Start difference. First operand 672 states and 826 transitions. Second operand 35 states. [2018-04-12 13:23:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:23:17,855 INFO L93 Difference]: Finished difference Result 1124 states and 1349 transitions. [2018-04-12 13:23:17,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 13:23:17,855 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 61 [2018-04-12 13:23:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:23:17,857 INFO L225 Difference]: With dead ends: 1124 [2018-04-12 13:23:17,857 INFO L226 Difference]: Without dead ends: 1124 [2018-04-12 13:23:17,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=704, Invalid=3718, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 13:23:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-04-12 13:23:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 712. [2018-04-12 13:23:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-04-12 13:23:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 874 transitions. [2018-04-12 13:23:17,862 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 874 transitions. Word has length 61 [2018-04-12 13:23:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:23:17,863 INFO L459 AbstractCegarLoop]: Abstraction has 712 states and 874 transitions. [2018-04-12 13:23:17,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 13:23:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 874 transitions. [2018-04-12 13:23:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 13:23:17,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:23:17,863 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:23:17,863 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr73AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr74EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr72AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-12 13:23:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2043180645, now seen corresponding path program 1 times [2018-04-12 13:23:17,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:23:17,863 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:23:17,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:23:17,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 13:23:17,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:23:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:23:17,872 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:23:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:23:18,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:23:18,145 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:23:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:23:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:23:18,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:23:18,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:23:18,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:23:18,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:23:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:23:18,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-12 13:23:18,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:18,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:18,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:23:18,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-04-12 13:23:18,267 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-12 13:23:18,273 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-12 13:23:18,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 13:23:18,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:23:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-12 13:23:18,300 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-12 13:23:18,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,315 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-12 13:23:18,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:113 [2018-04-12 13:23:18,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:18,412 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 88 treesize of output 82 [2018-04-12 13:23:18,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:23:18,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:18,455 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 103 treesize of output 97 [2018-04-12 13:23:18,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:23:18,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,494 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 78 treesize of output 69 [2018-04-12 13:23:18,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:23:18,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,504 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 84 [2018-04-12 13:23:18,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:23:18,531 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,540 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,567 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-12 13:23:18,567 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:192, output treesize:152 [2018-04-12 13:23:18,683 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 112 treesize of output 98 [2018-04-12 13:23:18,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:23:18,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,730 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 102 treesize of output 85 [2018-04-12 13:23:18,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:23:18,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,772 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 130 treesize of output 123 [2018-04-12 13:23:18,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:23:18,775 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,814 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 120 treesize of output 106 [2018-04-12 13:23:18,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:23:18,817 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,827 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:18,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 13:23:18,849 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:243, output treesize:203 [2018-04-12 13:23:22,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-04-12 13:23:22,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:22,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-12 13:23:22,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 13:23:23,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:195, output treesize:193 [2018-04-12 13:23:23,194 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 108 treesize of output 98 [2018-04-12 13:23:23,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,197 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 56 treesize of output 71 [2018-04-12 13:23:23,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,258 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 152 treesize of output 143 [2018-04-12 13:23:23,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-04-12 13:23:23,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,324 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 154 treesize of output 134 [2018-04-12 13:23:23,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 85 [2018-04-12 13:23:23,335 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 13:23:23,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 13:23:23,428 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 104 treesize of output 97 [2018-04-12 13:23:23,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-12 13:23:23,430 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-12 13:23:23,490 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:261, output treesize:350 [2018-04-12 13:23:23,629 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 126 treesize of output 112 [2018-04-12 13:23:23,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-04-12 13:23:23,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,692 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 92 [2018-04-12 13:23:23,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:23:23,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,749 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 125 treesize of output 116 [2018-04-12 13:23:23,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:23:23,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,775 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,812 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 106 treesize of output 97 [2018-04-12 13:23:23,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:23:23,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 13:23:23,816 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 13:23:23,856 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:252, output treesize:134 [2018-04-12 13:23:23,970 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 83 treesize of output 75 [2018-04-12 13:23:23,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 13:23:23,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:23:23,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:23,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-12 13:23:24,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 13:23:24,023 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:23:24,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,054 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 78 treesize of output 76 [2018-04-12 13:23:24,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:23:24,055 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:23:24,064 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,071 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,087 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 54 treesize of output 42 [2018-04-12 13:23:24,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:23:24,088 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 13:23:24,095 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,099 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:23:24,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 13:23:24,112 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:162, output treesize:56 [2018-04-12 13:23:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:23:24,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:23:24,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2018-04-12 13:23:24,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 13:23:24,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 13:23:24,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1216, Unknown=2, NotChecked=0, Total=1332 [2018-04-12 13:23:24,417 INFO L87 Difference]: Start difference. First operand 712 states and 874 transitions. Second operand 37 states. [2018-04-12 13:24:13,515 WARN L151 SmtUtils]: Spent 34119ms on a formula simplification. DAG size of input: 104 DAG size of output 79 Received shutdown request... [2018-04-12 13:24:37,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 13:24:37,607 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 13:24:37,611 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 13:24:37,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 01:24:37 BoogieIcfgContainer [2018-04-12 13:24:37,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 13:24:37,611 INFO L168 Benchmark]: Toolchain (without parser) took 868854.24 ms. Allocated memory was 404.8 MB in the beginning and 606.6 MB in the end (delta: 201.9 MB). Free memory was 341.1 MB in the beginning and 420.7 MB in the end (delta: -79.6 MB). Peak memory consumption was 122.2 MB. Max. memory is 5.3 GB. [2018-04-12 13:24:37,612 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.8 MB. Free memory is still 366.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 13:24:37,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.27 ms. Allocated memory is still 404.8 MB. Free memory was 341.1 MB in the beginning and 314.6 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-12 13:24:37,612 INFO L168 Benchmark]: Boogie Preprocessor took 32.83 ms. Allocated memory is still 404.8 MB. Free memory was 314.6 MB in the beginning and 312.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 13:24:37,613 INFO L168 Benchmark]: RCFGBuilder took 532.02 ms. Allocated memory was 404.8 MB in the beginning and 615.5 MB in the end (delta: 210.8 MB). Free memory was 312.0 MB in the beginning and 525.1 MB in the end (delta: -213.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-04-12 13:24:37,613 INFO L168 Benchmark]: TraceAbstraction took 868067.72 ms. Allocated memory was 615.5 MB in the beginning and 606.6 MB in the end (delta: -8.9 MB). Free memory was 525.1 MB in the beginning and 420.7 MB in the end (delta: 104.4 MB). Peak memory consumption was 95.5 MB. Max. memory is 5.3 GB. [2018-04-12 13:24:37,613 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.16 ms. Allocated memory is still 404.8 MB. Free memory is still 366.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.27 ms. Allocated memory is still 404.8 MB. Free memory was 341.1 MB in the beginning and 314.6 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.83 ms. Allocated memory is still 404.8 MB. Free memory was 314.6 MB in the beginning and 312.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 532.02 ms. Allocated memory was 404.8 MB in the beginning and 615.5 MB in the end (delta: 210.8 MB). Free memory was 312.0 MB in the beginning and 525.1 MB in the end (delta: -213.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 868067.72 ms. Allocated memory was 615.5 MB in the beginning and 606.6 MB in the end (delta: -8.9 MB). Free memory was 525.1 MB in the beginning and 420.7 MB in the end (delta: 104.4 MB). Peak memory consumption was 95.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 685]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 683]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 683]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 685]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (712states) and interpolant automaton (currently 15 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 177 locations, 75 error locations. TIMEOUT Result, 868.0s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 767.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5927 SDtfs, 24283 SDslu, 35882 SDs, 0 SdLazy, 41683 SolverSat, 3047 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 144.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1992 GetRequests, 757 SyntacticMatches, 55 SemanticMatches, 1179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21840 ImplicationChecksByTransitivity, 688.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=42, 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.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 8975 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 98.5s InterpolantComputationTime, 2613 NumberOfCodeBlocks, 2613 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2552 ConstructedInterpolants, 291 QuantifiedInterpolants, 2476075 SizeOfPredicates, 322 NumberOfNonLiveVariables, 4012 ConjunctsInSsa, 796 ConjunctsInUnsatCore, 61 InterpolantComputations, 27 PerfectInterpolantSequences, 351/756 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_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_13-24-37-618.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_13-24-37-618.csv Completed graceful shutdown