java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:41:00,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:41:00,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:41:00,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:41:00,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:41:00,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:41:00,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:41:00,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:41:00,269 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:41:00,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:41:00,270 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:41:00,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:41:00,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:41:00,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:41:00,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:41:00,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:41:00,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:41:00,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:41:00,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:41:00,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:41:00,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:41:00,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:41:00,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:41:00,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:41:00,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:41:00,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:41:00,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:41:00,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:41:00,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:41:00,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:41:00,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:41:00,281 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:41:00,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:41:00,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:41:00,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:41:00,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:41:00,301 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:41:00,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:41:00,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:41:00,301 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:41:00,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:41:00,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:41:00,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:41:00,302 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:41:00,302 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:41:00,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:41:00,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:41:00,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:41:00,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:41:00,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:41:00,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:41:00,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:41:00,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:41:00,304 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:41:00,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:41:00,304 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:41:00,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:41:00,347 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:41:00,350 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:41:00,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:41:00,352 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:41:00,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,652 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG56caf609d [2018-04-11 15:41:00,789 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:41:00,790 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:41:00,790 INFO L168 CDTParser]: Scanning test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,797 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:41:00,798 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:41:00,798 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:41:00,798 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,798 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0504_true-valid-memsafety.i [2018-04-11 15:41:00,819 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG56caf609d [2018-04-11 15:41:00,823 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:41:00,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:41:00,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:41:00,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:41:00,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:41:00,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:41:00" (1/1) ... [2018-04-11 15:41:00,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292da3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:00, skipping insertion in model container [2018-04-11 15:41:00,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:41:00" (1/1) ... [2018-04-11 15:41:00,849 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:41:00,870 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:41:00,994 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:41:01,033 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:41:01,039 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 15:41:01,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01 WrapperNode [2018-04-11 15:41:01,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:41:01,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:41:01,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:41:01,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:41:01,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... [2018-04-11 15:41:01,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:41:01,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:41:01,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:41:01,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:41:01,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:41:01,195 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:41:01,195 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:41:01,195 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:41:01,195 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:41:01,196 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:41:01,197 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:41:01,198 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:41:01,199 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:41:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:41:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:41:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:41:01,203 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:41:01,204 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 15:41:01,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:41:01,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:41:01,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:41:01,206 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:41:01,206 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:41:01,768 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:41:01,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:41:01 BoogieIcfgContainer [2018-04-11 15:41:01,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:41:01,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:41:01,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:41:01,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:41:01,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:41:00" (1/3) ... [2018-04-11 15:41:01,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1757e190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:41:01, skipping insertion in model container [2018-04-11 15:41:01,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:41:01" (2/3) ... [2018-04-11 15:41:01,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1757e190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:41:01, skipping insertion in model container [2018-04-11 15:41:01,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:41:01" (3/3) ... [2018-04-11 15:41:01,773 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-04-11 15:41:01,779 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:41:01,784 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-04-11 15:41:01,827 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:41:01,827 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:41:01,827 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:41:01,827 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:41:01,827 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:41:01,828 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:41:01,828 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:41:01,828 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:41:01,828 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:41:01,828 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:41:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-04-11 15:41:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:41:01,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:01,852 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:01,852 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash -671861095, now seen corresponding path program 1 times [2018-04-11 15:41:01,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:01,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:01,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:01,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:01,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:01,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:01,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:41:01,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 15:41:01,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 15:41:01,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 15:41:01,974 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-04-11 15:41:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:01,996 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-04-11 15:41:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 15:41:01,997 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-04-11 15:41:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:02,007 INFO L225 Difference]: With dead ends: 98 [2018-04-11 15:41:02,007 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 15:41:02,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 15:41:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 15:41:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-11 15:41:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 15:41:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-04-11 15:41:02,039 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2018-04-11 15:41:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:02,039 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-04-11 15:41:02,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 15:41:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-04-11 15:41:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 15:41:02,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:02,040 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:02,040 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash 117051847, now seen corresponding path program 1 times [2018-04-11 15:41:02,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:02,040 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:02,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:02,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:02,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:02,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:02,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:02,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:41:02,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:41:02,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:41:02,105 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 3 states. [2018-04-11 15:41:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:02,161 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-11 15:41:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:41:02,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 15:41:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:02,163 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:41:02,163 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:41:02,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:41:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:41:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2018-04-11 15:41:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 15:41:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2018-04-11 15:41:02,174 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 12 [2018-04-11 15:41:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:02,174 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2018-04-11 15:41:02,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:41:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2018-04-11 15:41:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:41:02,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:02,175 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:02,175 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash -666360665, now seen corresponding path program 1 times [2018-04-11 15:41:02,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:02,175 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:02,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:02,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:02,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:02,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:02,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:41:02,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:41:02,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:41:02,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:41:02,203 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 3 states. [2018-04-11 15:41:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:02,260 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-04-11 15:41:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:41:02,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-11 15:41:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:02,261 INFO L225 Difference]: With dead ends: 128 [2018-04-11 15:41:02,261 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 15:41:02,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:41:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 15:41:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 15:41:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 15:41:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2018-04-11 15:41:02,269 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 13 [2018-04-11 15:41:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:02,269 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2018-04-11 15:41:02,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:41:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2018-04-11 15:41:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:41:02,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:02,270 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:02,270 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash -667226745, now seen corresponding path program 1 times [2018-04-11 15:41:02,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:02,270 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:02,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:02,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:02,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:02,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:02,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:02,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:02,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:02,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:02,317 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand 4 states. [2018-04-11 15:41:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:02,415 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2018-04-11 15:41:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:41:02,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:41:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:02,416 INFO L225 Difference]: With dead ends: 145 [2018-04-11 15:41:02,416 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 15:41:02,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 15:41:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2018-04-11 15:41:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:41:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2018-04-11 15:41:02,424 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 13 [2018-04-11 15:41:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:02,424 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2018-04-11 15:41:02,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2018-04-11 15:41:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:41:02,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:02,425 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:02,425 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -667226744, now seen corresponding path program 1 times [2018-04-11 15:41:02,425 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:02,425 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:02,426 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:02,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:02,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:02,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:02,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:02,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:02,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:02,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:02,481 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 4 states. [2018-04-11 15:41:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:02,585 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2018-04-11 15:41:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:41:02,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:41:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:02,586 INFO L225 Difference]: With dead ends: 160 [2018-04-11 15:41:02,586 INFO L226 Difference]: Without dead ends: 160 [2018-04-11 15:41:02,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-11 15:41:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2018-04-11 15:41:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 15:41:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2018-04-11 15:41:02,599 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 13 [2018-04-11 15:41:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:02,599 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2018-04-11 15:41:02,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-04-11 15:41:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:41:02,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:02,600 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:02,600 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1900820966, now seen corresponding path program 1 times [2018-04-11 15:41:02,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:02,601 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:02,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:02,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:02,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:02,629 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:02,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:02,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:02,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:02,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:02,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:02,727 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 24 [2018-04-11 15:41:02,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:02,744 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 2 xjuncts. [2018-04-11 15:41:02,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-04-11 15:41:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:02,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:02,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:41:02,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:41:02,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:41:02,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:41:02,792 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 7 states. [2018-04-11 15:41:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:03,041 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-04-11 15:41:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:41:03,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-11 15:41:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:03,042 INFO L225 Difference]: With dead ends: 191 [2018-04-11 15:41:03,043 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 15:41:03,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:41:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 15:41:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 115. [2018-04-11 15:41:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:41:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2018-04-11 15:41:03,049 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 25 [2018-04-11 15:41:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:03,049 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2018-04-11 15:41:03,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:41:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2018-04-11 15:41:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:41:03,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:03,050 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] [2018-04-11 15:41:03,052 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1204092197, now seen corresponding path program 1 times [2018-04-11 15:41:03,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:03,052 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:03,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:03,053 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:03,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:03,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:03,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:03,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:03,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:03,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:03,098 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 4 states. [2018-04-11 15:41:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:03,204 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2018-04-11 15:41:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:41:03,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 15:41:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:03,207 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:41:03,207 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:41:03,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:41:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 111. [2018-04-11 15:41:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 15:41:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2018-04-11 15:41:03,219 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 26 [2018-04-11 15:41:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:03,219 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2018-04-11 15:41:03,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-04-11 15:41:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:41:03,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:03,220 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] [2018-04-11 15:41:03,220 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1204092198, now seen corresponding path program 1 times [2018-04-11 15:41:03,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:03,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:03,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:03,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:03,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:03,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:03,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:03,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:03,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:03,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:03,286 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 4 states. [2018-04-11 15:41:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:03,370 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-04-11 15:41:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:41:03,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 15:41:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:03,371 INFO L225 Difference]: With dead ends: 149 [2018-04-11 15:41:03,371 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 15:41:03,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 15:41:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 107. [2018-04-11 15:41:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 15:41:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-04-11 15:41:03,375 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 26 [2018-04-11 15:41:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:03,375 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-04-11 15:41:03,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-04-11 15:41:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:41:03,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:03,376 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, 1] [2018-04-11 15:41:03,376 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash -230772510, now seen corresponding path program 1 times [2018-04-11 15:41:03,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:03,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:03,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:03,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:03,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:03,416 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-11 15:41:03,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:03,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:03,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:03,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:03,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:03,418 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 4 states. [2018-04-11 15:41:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:03,516 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-04-11 15:41:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:03,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 15:41:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:03,517 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:41:03,517 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:41:03,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:41:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2018-04-11 15:41:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 15:41:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2018-04-11 15:41:03,520 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 28 [2018-04-11 15:41:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:03,520 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2018-04-11 15:41:03,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2018-04-11 15:41:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:41:03,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:03,520 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, 1] [2018-04-11 15:41:03,521 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash -230772509, now seen corresponding path program 1 times [2018-04-11 15:41:03,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:03,521 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:03,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:03,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:03,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:03,582 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-11 15:41:03,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:03,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:41:03,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:41:03,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:41:03,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:03,582 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 5 states. [2018-04-11 15:41:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:03,699 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-04-11 15:41:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:03,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 15:41:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:03,700 INFO L225 Difference]: With dead ends: 185 [2018-04-11 15:41:03,701 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 15:41:03,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:41:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 15:41:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 136. [2018-04-11 15:41:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 15:41:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2018-04-11 15:41:03,704 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 28 [2018-04-11 15:41:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:03,704 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2018-04-11 15:41:03,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:41:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2018-04-11 15:41:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:41:03,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:03,705 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:03,705 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -456182561, now seen corresponding path program 1 times [2018-04-11 15:41:03,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:03,706 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:03,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:03,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:03,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:03,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:03,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:03,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:03,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:03,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:03,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:03,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:41:03,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:03,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-04-11 15:41:03,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:03,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:03,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-11 15:41:03,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:03,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:03,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:03,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-11 15:41:03,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-11 15:41:03,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-11 15:41:03,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:03,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-11 15:41:03,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-04-11 15:41:03,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:03,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-11 15:41:03,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:03,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-04-11 15:41:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:03,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:03,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:41:03,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:41:03,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:41:03,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:41:03,912 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 9 states. [2018-04-11 15:41:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:04,203 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2018-04-11 15:41:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:41:04,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-11 15:41:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:04,204 INFO L225 Difference]: With dead ends: 243 [2018-04-11 15:41:04,204 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 15:41:04,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:41:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 15:41:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 152. [2018-04-11 15:41:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 15:41:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2018-04-11 15:41:04,209 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 29 [2018-04-11 15:41:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:04,209 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2018-04-11 15:41:04,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:41:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2018-04-11 15:41:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:41:04,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:04,210 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:04,210 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -456182560, now seen corresponding path program 1 times [2018-04-11 15:41:04,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:04,210 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:04,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:04,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:04,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:04,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:04,238 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:04,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:04,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:04,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:04,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:04,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:04,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:41:04,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:04,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:04,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:04,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:04,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-11 15:41:04,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:04,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:04,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:04,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:04,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:04,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:04,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 15:41:04,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:04,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:41:04,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:04,372 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 2 xjuncts. [2018-04-11 15:41:04,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:88 [2018-04-11 15:41:04,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 77 [2018-04-11 15:41:04,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-04-11 15:41:04,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 73 [2018-04-11 15:41:04,514 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 66 treesize of output 65 [2018-04-11 15:41:04,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 72 [2018-04-11 15:41:04,590 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 65 treesize of output 64 [2018-04-11 15:41:04,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 68 [2018-04-11 15:41:04,656 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 61 treesize of output 60 [2018-04-11 15:41:04,656 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 15:41:04,722 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:134, output treesize:118 [2018-04-11 15:41:04,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-04-11 15:41:04,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2018-04-11 15:41:04,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-04-11 15:41:04,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2018-04-11 15:41:04,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 73 [2018-04-11 15:41:04,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-11 15:41:04,869 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,905 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 62 treesize of output 50 [2018-04-11 15:41:04,905 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2018-04-11 15:41:04,932 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:04,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2018-04-11 15:41:04,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 15:41:04,987 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:05,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:05,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:41:05,021 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:146, output treesize:24 [2018-04-11 15:41:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:05,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:05,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:41:05,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:41:05,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:41:05,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=68, Unknown=2, NotChecked=0, Total=90 [2018-04-11 15:41:05,042 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 10 states. [2018-04-11 15:41:05,276 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 65 DAG size of output 65 [2018-04-11 15:41:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:05,531 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2018-04-11 15:41:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:41:05,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-11 15:41:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:05,533 INFO L225 Difference]: With dead ends: 194 [2018-04-11 15:41:05,533 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 15:41:05,533 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=186, Unknown=4, NotChecked=0, Total=240 [2018-04-11 15:41:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 15:41:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2018-04-11 15:41:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 15:41:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-04-11 15:41:05,537 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 29 [2018-04-11 15:41:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:05,537 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-04-11 15:41:05,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:41:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-04-11 15:41:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:41:05,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:05,538 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, 1, 1] [2018-04-11 15:41:05,538 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1435986156, now seen corresponding path program 1 times [2018-04-11 15:41:05,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:05,538 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:05,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:05,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:05,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:05,581 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-11 15:41:05,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:05,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:41:05,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:41:05,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:41:05,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:05,582 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 5 states. [2018-04-11 15:41:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:05,634 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-04-11 15:41:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:05,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 15:41:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:05,635 INFO L225 Difference]: With dead ends: 156 [2018-04-11 15:41:05,635 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 15:41:05,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11 15:41:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 15:41:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-04-11 15:41:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 15:41:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-04-11 15:41:05,638 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 29 [2018-04-11 15:41:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:05,638 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-04-11 15:41:05,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:41:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-04-11 15:41:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:41:05,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:05,639 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, 1, 1, 1] [2018-04-11 15:41:05,639 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1565919907, now seen corresponding path program 1 times [2018-04-11 15:41:05,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:05,640 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:05,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:05,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:05,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:41:05,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:05,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:05,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:05,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:05,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:05,663 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 4 states. [2018-04-11 15:41:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:05,707 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2018-04-11 15:41:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:05,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-11 15:41:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:05,708 INFO L225 Difference]: With dead ends: 166 [2018-04-11 15:41:05,708 INFO L226 Difference]: Without dead ends: 166 [2018-04-11 15:41:05,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-11 15:41:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2018-04-11 15:41:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 15:41:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-04-11 15:41:05,711 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 30 [2018-04-11 15:41:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:05,712 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-04-11 15:41:05,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-04-11 15:41:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:41:05,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:05,712 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, 1, 1, 1] [2018-04-11 15:41:05,713 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1565919908, now seen corresponding path program 1 times [2018-04-11 15:41:05,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:05,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:05,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:05,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:05,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:05,770 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-11 15:41:05,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:05,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:41:05,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:41:05,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:41:05,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:41:05,772 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 6 states. [2018-04-11 15:41:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:05,940 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2018-04-11 15:41:05,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:41:05,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 15:41:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:05,941 INFO L225 Difference]: With dead ends: 228 [2018-04-11 15:41:05,941 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 15:41:05,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:41:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 15:41:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 169. [2018-04-11 15:41:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:41:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-04-11 15:41:05,945 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 30 [2018-04-11 15:41:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:05,945 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-04-11 15:41:05,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:41:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-04-11 15:41:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:41:05,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:05,946 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:05,946 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1482847976, now seen corresponding path program 1 times [2018-04-11 15:41:05,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:05,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:05,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:05,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:05,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:05,958 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:05,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:05,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:05,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:05,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:05,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:05,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:05,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:06,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:06,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-11 15:41:06,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:06,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:06,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:06,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:06,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 15:41:06,097 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 22 treesize of output 16 [2018-04-11 15:41:06,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-11 15:41:06,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,114 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 22 treesize of output 16 [2018-04-11 15:41:06,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-11 15:41:06,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-04-11 15:41:06,156 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-11 15:41:06,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:06,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:41:06,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:41:06,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:41:06,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:41:06,157 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 10 states. [2018-04-11 15:41:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:06,480 INFO L93 Difference]: Finished difference Result 252 states and 280 transitions. [2018-04-11 15:41:06,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:41:06,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-11 15:41:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:06,481 INFO L225 Difference]: With dead ends: 252 [2018-04-11 15:41:06,481 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 15:41:06,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:41:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 15:41:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 180. [2018-04-11 15:41:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 15:41:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2018-04-11 15:41:06,485 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 34 [2018-04-11 15:41:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:06,485 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2018-04-11 15:41:06,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:41:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2018-04-11 15:41:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:41:06,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:06,486 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] [2018-04-11 15:41:06,487 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash 794616337, now seen corresponding path program 1 times [2018-04-11 15:41:06,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:06,487 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:06,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:06,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:06,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:06,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:06,500 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:06,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:06,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:06,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:06,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:06,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:06,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 10 treesize of output 9 [2018-04-11 15:41:06,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:06,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:06,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-11 15:41:06,555 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 18 [2018-04-11 15:41:06,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,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 18 treesize of output 27 [2018-04-11 15:41:06,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,573 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 18 [2018-04-11 15:41:06,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,577 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 18 treesize of output 27 [2018-04-11 15:41:06,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-11 15:41:06,598 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 30 treesize of output 23 [2018-04-11 15:41:06,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,605 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 23 treesize of output 46 [2018-04-11 15:41:06,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 15:41:06,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,628 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 23 treesize of output 46 [2018-04-11 15:41:06,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 15:41:06,653 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 39 treesize of output 30 [2018-04-11 15:41:06,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-11 15:41:06,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-11 15:41:06,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-11 15:41:06,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-11 15:41:06,773 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 44 treesize of output 34 [2018-04-11 15:41:06,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-04-11 15:41:06,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:06,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:06,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:47 [2018-04-11 15:41:06,812 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 51 treesize of output 39 [2018-04-11 15:41:06,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 84 [2018-04-11 15:41:06,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:41:06,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:06,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:06,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:28 [2018-04-11 15:41:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:06,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:06,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 15:41:06,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:41:06,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:41:06,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:41:06,893 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 11 states. [2018-04-11 15:41:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:07,409 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-04-11 15:41:07,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:41:07,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-04-11 15:41:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:07,410 INFO L225 Difference]: With dead ends: 196 [2018-04-11 15:41:07,410 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 15:41:07,410 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:41:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 15:41:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2018-04-11 15:41:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 15:41:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2018-04-11 15:41:07,413 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 39 [2018-04-11 15:41:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:07,413 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2018-04-11 15:41:07,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:41:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2018-04-11 15:41:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:41:07,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:07,413 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:07,413 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:07,414 INFO L82 PathProgramCache]: Analyzing trace with hash 932480026, now seen corresponding path program 1 times [2018-04-11 15:41:07,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:07,414 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:07,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:07,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:07,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:07,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:07,422 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:07,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:07,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:07,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:07,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:07,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:07,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:07,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:41:07,472 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 12 treesize of output 11 [2018-04-11 15:41:07,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:07,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:07,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:41:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:07,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:07,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-11 15:41:07,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:41:07,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:41:07,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:07,481 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand 5 states. [2018-04-11 15:41:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:07,555 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2018-04-11 15:41:07,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:07,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 15:41:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:07,556 INFO L225 Difference]: With dead ends: 211 [2018-04-11 15:41:07,556 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 15:41:07,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:41:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 15:41:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2018-04-11 15:41:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 15:41:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-04-11 15:41:07,559 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 39 [2018-04-11 15:41:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:07,559 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-04-11 15:41:07,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:41:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-04-11 15:41:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:41:07,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:07,559 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:07,560 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash 932480027, now seen corresponding path program 1 times [2018-04-11 15:41:07,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:07,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:07,560 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:07,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:07,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:07,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:07,570 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:07,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:07,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:07,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:07,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:07,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:07,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:07,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:41:07,615 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 12 treesize of output 11 [2018-04-11 15:41:07,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:07,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:07,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 15:41:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:07,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:07,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-11 15:41:07,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:41:07,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:41:07,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:07,626 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 5 states. [2018-04-11 15:41:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:07,723 INFO L93 Difference]: Finished difference Result 241 states and 267 transitions. [2018-04-11 15:41:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:07,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 15:41:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:07,724 INFO L225 Difference]: With dead ends: 241 [2018-04-11 15:41:07,727 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 15:41:07,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:41:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 15:41:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 202. [2018-04-11 15:41:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 15:41:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2018-04-11 15:41:07,731 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 39 [2018-04-11 15:41:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:07,731 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2018-04-11 15:41:07,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:41:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2018-04-11 15:41:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:41:07,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:07,732 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:07,732 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1136697955, now seen corresponding path program 1 times [2018-04-11 15:41:07,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:07,732 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:07,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:07,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:07,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:07,741 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:07,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:07,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:07,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:07,817 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)))) is different from true [2018-04-11 15:41:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 15:41:07,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:07,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 15:41:07,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:41:07,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:41:07,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-04-11 15:41:07,825 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand 8 states. [2018-04-11 15:41:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:08,069 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2018-04-11 15:41:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:41:08,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-04-11 15:41:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:08,070 INFO L225 Difference]: With dead ends: 205 [2018-04-11 15:41:08,070 INFO L226 Difference]: Without dead ends: 190 [2018-04-11 15:41:08,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=93, Unknown=2, NotChecked=20, Total=156 [2018-04-11 15:41:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-11 15:41:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-04-11 15:41:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 15:41:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2018-04-11 15:41:08,074 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 40 [2018-04-11 15:41:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:08,074 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2018-04-11 15:41:08,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:41:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2018-04-11 15:41:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:41:08,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:08,075 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] [2018-04-11 15:41:08,075 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1024639304, now seen corresponding path program 1 times [2018-04-11 15:41:08,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:08,076 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:08,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:08,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:08,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:08,092 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:08,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:08,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:08,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:08,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:08,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:41:08,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:08,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:08,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:41:08,171 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 7 treesize of output 5 [2018-04-11 15:41:08,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:08,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-11 15:41:08,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:08,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:08,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:41:08,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:08,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:41:08,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-04-11 15:41:08,242 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-11 15:41:08,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:08,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:41:08,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:41:08,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:41:08,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:41:08,243 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand 9 states. [2018-04-11 15:41:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:08,560 INFO L93 Difference]: Finished difference Result 277 states and 307 transitions. [2018-04-11 15:41:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:41:08,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-11 15:41:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:08,561 INFO L225 Difference]: With dead ends: 277 [2018-04-11 15:41:08,561 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 15:41:08,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:41:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 15:41:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 194. [2018-04-11 15:41:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 15:41:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2018-04-11 15:41:08,566 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 44 [2018-04-11 15:41:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:08,566 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2018-04-11 15:41:08,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:41:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2018-04-11 15:41:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:41:08,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:08,566 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 15:41:08,567 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:08,567 INFO L82 PathProgramCache]: Analyzing trace with hash 703750570, now seen corresponding path program 1 times [2018-04-11 15:41:08,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:08,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:08,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:08,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:08,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:08,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:08,579 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:08,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:08,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:08,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:08,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:08,623 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 12 treesize of output 11 [2018-04-11 15:41:08,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 15:41:08,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:08,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:08,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 15:41:08,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:08,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:08,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:08,664 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 26 treesize of output 38 [2018-04-11 15:41:08,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:08,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:32 [2018-04-11 15:41:08,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-04-11 15:41:08,712 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 34 treesize of output 33 [2018-04-11 15:41:08,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:08,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2018-04-11 15:41:08,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-11 15:41:08,755 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 23 [2018-04-11 15:41:08,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-04-11 15:41:08,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,775 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 26 treesize of output 10 [2018-04-11 15:41:08,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:08,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:08,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:50, output treesize:24 [2018-04-11 15:41:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:08,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:08,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 15:41:08,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:41:08,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:41:08,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:41:08,802 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand 10 states. [2018-04-11 15:41:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:09,215 INFO L93 Difference]: Finished difference Result 242 states and 268 transitions. [2018-04-11 15:41:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:41:09,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-11 15:41:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:09,218 INFO L225 Difference]: With dead ends: 242 [2018-04-11 15:41:09,219 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 15:41:09,219 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:41:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 15:41:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2018-04-11 15:41:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 15:41:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2018-04-11 15:41:09,221 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 45 [2018-04-11 15:41:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:09,221 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2018-04-11 15:41:09,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:41:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2018-04-11 15:41:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:41:09,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:09,222 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 15:41:09,222 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 703750571, now seen corresponding path program 1 times [2018-04-11 15:41:09,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:09,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:09,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:09,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:09,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:09,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:09,234 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:09,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:09,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:09,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:09,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:09,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:09,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:09,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:09,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 15:41:09,310 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2018-04-11 15:41:09,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:09,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:09,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2018-04-11 15:41:09,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-11 15:41:09,408 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 26 treesize of output 25 [2018-04-11 15:41:09,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-04-11 15:41:09,467 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 24 treesize of output 23 [2018-04-11 15:41:09,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:09,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:44 [2018-04-11 15:41:09,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-04-11 15:41:09,530 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 24 treesize of output 17 [2018-04-11 15:41:09,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-11 15:41:09,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,557 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 20 treesize of output 5 [2018-04-11 15:41:09,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-04-11 15:41:09,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 15:41:09,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,591 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 18 treesize of output 3 [2018-04-11 15:41:09,592 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:09,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:09,601 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:58, output treesize:14 [2018-04-11 15:41:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:09,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:09,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 15:41:09,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:41:09,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:41:09,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2018-04-11 15:41:09,621 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand 10 states. [2018-04-11 15:41:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:10,081 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2018-04-11 15:41:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:41:10,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-11 15:41:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:10,082 INFO L225 Difference]: With dead ends: 262 [2018-04-11 15:41:10,083 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 15:41:10,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=275, Unknown=3, NotChecked=0, Total=380 [2018-04-11 15:41:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 15:41:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 176. [2018-04-11 15:41:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 15:41:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-04-11 15:41:10,087 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 45 [2018-04-11 15:41:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:10,087 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-04-11 15:41:10,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:41:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-04-11 15:41:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:41:10,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:10,088 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] [2018-04-11 15:41:10,088 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1130858695, now seen corresponding path program 1 times [2018-04-11 15:41:10,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:10,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:10,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:10,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:10,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:10,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:41:10,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:10,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:41:10,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:41:10,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:41:10,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:41:10,164 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 7 states. [2018-04-11 15:41:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:10,310 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2018-04-11 15:41:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:41:10,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-11 15:41:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:10,311 INFO L225 Difference]: With dead ends: 204 [2018-04-11 15:41:10,311 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 15:41:10,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:41:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 15:41:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 173. [2018-04-11 15:41:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-11 15:41:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2018-04-11 15:41:10,316 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 46 [2018-04-11 15:41:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:10,316 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2018-04-11 15:41:10,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:41:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2018-04-11 15:41:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:41:10,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:10,317 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] [2018-04-11 15:41:10,317 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1086492925, now seen corresponding path program 1 times [2018-04-11 15:41:10,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:10,317 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:10,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:10,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:10,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:10,381 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-11 15:41:10,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:10,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:41:10,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:41:10,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:41:10,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:41:10,382 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 8 states. [2018-04-11 15:41:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:10,599 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2018-04-11 15:41:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:41:10,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 15:41:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:10,600 INFO L225 Difference]: With dead ends: 212 [2018-04-11 15:41:10,600 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 15:41:10,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:41:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 15:41:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 182. [2018-04-11 15:41:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 15:41:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2018-04-11 15:41:10,604 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 50 [2018-04-11 15:41:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:10,604 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2018-04-11 15:41:10,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:41:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2018-04-11 15:41:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:41:10,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:10,605 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] [2018-04-11 15:41:10,605 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1086492926, now seen corresponding path program 1 times [2018-04-11 15:41:10,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:10,606 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:10,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:10,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:10,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:10,706 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-11 15:41:10,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:10,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:41:10,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:41:10,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:41:10,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:41:10,707 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand 9 states. [2018-04-11 15:41:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:11,049 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-04-11 15:41:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:41:11,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-04-11 15:41:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:11,051 INFO L225 Difference]: With dead ends: 311 [2018-04-11 15:41:11,051 INFO L226 Difference]: Without dead ends: 311 [2018-04-11 15:41:11,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:41:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-11 15:41:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 182. [2018-04-11 15:41:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 15:41:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 204 transitions. [2018-04-11 15:41:11,055 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 204 transitions. Word has length 50 [2018-04-11 15:41:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:11,055 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 204 transitions. [2018-04-11 15:41:11,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:41:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 204 transitions. [2018-04-11 15:41:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:41:11,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:11,057 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] [2018-04-11 15:41:11,057 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 442651197, now seen corresponding path program 1 times [2018-04-11 15:41:11,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:11,058 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:11,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:11,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:11,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:11,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:11,133 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-11 15:41:11,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:11,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:41:11,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:41:11,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:41:11,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:41:11,134 INFO L87 Difference]: Start difference. First operand 182 states and 204 transitions. Second operand 10 states. [2018-04-11 15:41:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:11,496 INFO L93 Difference]: Finished difference Result 369 states and 406 transitions. [2018-04-11 15:41:11,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:41:11,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-11 15:41:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:11,497 INFO L225 Difference]: With dead ends: 369 [2018-04-11 15:41:11,497 INFO L226 Difference]: Without dead ends: 369 [2018-04-11 15:41:11,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:41:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-11 15:41:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 184. [2018-04-11 15:41:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 15:41:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-04-11 15:41:11,501 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 52 [2018-04-11 15:41:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:11,502 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-04-11 15:41:11,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:41:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-04-11 15:41:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 15:41:11,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:11,503 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] [2018-04-11 15:41:11,503 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 837285383, now seen corresponding path program 1 times [2018-04-11 15:41:11,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:11,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:11,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:11,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:11,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:11,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 15:41:11,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:41:11,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:41:11,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:41:11,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:41:11,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:41:11,531 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 4 states. [2018-04-11 15:41:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:11,592 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2018-04-11 15:41:11,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:41:11,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-04-11 15:41:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:11,594 INFO L225 Difference]: With dead ends: 183 [2018-04-11 15:41:11,594 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 15:41:11,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:41:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 15:41:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-11 15:41:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 15:41:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2018-04-11 15:41:11,596 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 53 [2018-04-11 15:41:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:11,597 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2018-04-11 15:41:11,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:41:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2018-04-11 15:41:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 15:41:11,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:11,597 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:11,598 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2106709023, now seen corresponding path program 1 times [2018-04-11 15:41:11,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:11,598 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:11,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:11,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:11,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:11,611 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:11,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:11,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:11,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:11,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:11,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:41:11,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:11,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:11,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:11,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:11,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 15:41:11,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:11,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:11,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:11,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:11,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 15:41:11,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:41:11,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-04-11 15:41:11,792 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 28 treesize of output 29 [2018-04-11 15:41:11,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:11,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,818 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 28 treesize of output 29 [2018-04-11 15:41:11,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:11,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-04-11 15:41:11,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 15:41:11,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 15:41:11,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 15:41:11,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,898 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 18 treesize of output 27 [2018-04-11 15:41:11,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-04-11 15:41:11,954 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 44 treesize of output 41 [2018-04-11 15:41:11,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:41:11,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:11,989 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 44 treesize of output 41 [2018-04-11 15:41:11,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:11,995 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 23 treesize of output 46 [2018-04-11 15:41:11,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:92 [2018-04-11 15:41:12,063 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 53 treesize of output 48 [2018-04-11 15:41:12,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-11 15:41:12,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,114 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 53 treesize of output 48 [2018-04-11 15:41:12,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-11 15:41:12,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:110 [2018-04-11 15:41:12,192 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 62 treesize of output 59 [2018-04-11 15:41:12,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,197 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 21 treesize of output 36 [2018-04-11 15:41:12,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,235 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 62 treesize of output 59 [2018-04-11 15:41:12,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-04-11 15:41:12,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:128 [2018-04-11 15:41:12,316 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 265 treesize of output 234 [2018-04-11 15:41:12,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 209 [2018-04-11 15:41:12,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 206 [2018-04-11 15:41:12,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 231 [2018-04-11 15:41:12,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:12,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:295, output treesize:245 [2018-04-11 15:41:12,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 189 [2018-04-11 15:41:12,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 123 [2018-04-11 15:41:12,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 97 [2018-04-11 15:41:12,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:12,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:12,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 70 [2018-04-11 15:41:12,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:12,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2018-04-11 15:41:12,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-11 15:41:12,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:12,628 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:262, output treesize:10 [2018-04-11 15:41:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:12,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:12,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:41:12,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:41:12,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:41:12,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:41:12,684 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand 18 states. [2018-04-11 15:41:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:16,023 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-04-11 15:41:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:41:16,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-04-11 15:41:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:16,024 INFO L225 Difference]: With dead ends: 269 [2018-04-11 15:41:16,024 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 15:41:16,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:41:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 15:41:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 210. [2018-04-11 15:41:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 15:41:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 233 transitions. [2018-04-11 15:41:16,027 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 233 transitions. Word has length 53 [2018-04-11 15:41:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:16,027 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 233 transitions. [2018-04-11 15:41:16,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:41:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 233 transitions. [2018-04-11 15:41:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:41:16,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:16,028 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:16,028 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash 80923932, now seen corresponding path program 1 times [2018-04-11 15:41:16,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:16,028 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:16,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:16,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:16,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:16,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:16,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:16,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:16,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:16,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:16,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:16,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:16,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 15:41:16,186 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 7 treesize of output 5 [2018-04-11 15:41:16,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:16,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-11 15:41:16,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:16,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:16,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:41:16,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 15:41:16,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:16,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:16,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:16,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-04-11 15:41:16,286 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 16 treesize of output 12 [2018-04-11 15:41:16,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-04-11 15:41:16,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:16,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:16,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:16,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-04-11 15:41:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:16,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:41:16,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-04-11 15:41:16,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:41:16,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:41:16,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:41:16,352 INFO L87 Difference]: Start difference. First operand 210 states and 233 transitions. Second operand 22 states. [2018-04-11 15:41:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:17,034 INFO L93 Difference]: Finished difference Result 363 states and 395 transitions. [2018-04-11 15:41:17,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:41:17,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-04-11 15:41:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:17,035 INFO L225 Difference]: With dead ends: 363 [2018-04-11 15:41:17,035 INFO L226 Difference]: Without dead ends: 363 [2018-04-11 15:41:17,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:41:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-11 15:41:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 210. [2018-04-11 15:41:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 15:41:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2018-04-11 15:41:17,039 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 55 [2018-04-11 15:41:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:17,039 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2018-04-11 15:41:17,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:41:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2018-04-11 15:41:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:41:17,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:17,040 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:17,040 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash 218787622, now seen corresponding path program 1 times [2018-04-11 15:41:17,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:17,040 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:17,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:17,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:17,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:17,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:17,053 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:17,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:17,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:17,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:17,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:17,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:17,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:41:17,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:17,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:17,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-04-11 15:41:17,135 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 7 treesize of output 5 [2018-04-11 15:41:17,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:17,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-11 15:41:17,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:41:17,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:41:17,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,158 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-11 15:41:17,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 15:41:17,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,212 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:41:17,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:17,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 15:41:17,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:38 [2018-04-11 15:41:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:17,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:17,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 15:41:17,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:41:17,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:41:17,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:41:17,260 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand 9 states. [2018-04-11 15:41:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:17,572 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2018-04-11 15:41:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:41:17,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-04-11 15:41:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:17,573 INFO L225 Difference]: With dead ends: 346 [2018-04-11 15:41:17,573 INFO L226 Difference]: Without dead ends: 346 [2018-04-11 15:41:17,573 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:41:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-11 15:41:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 191. [2018-04-11 15:41:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 15:41:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-11 15:41:17,577 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 55 [2018-04-11 15:41:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:17,577 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-11 15:41:17,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:41:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-11 15:41:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:41:17,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:17,578 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:17,578 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -892519642, now seen corresponding path program 2 times [2018-04-11 15:41:17,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:17,578 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:17,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:17,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:17,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:17,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:17,594 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:17,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:17,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:17,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:41:17,620 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:41:17,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:41:17,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:17,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:17,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,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-11 15:41:17,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:41:17,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:41:17,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:41:17,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,712 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-11 15:41:17,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-04-11 15:41:17,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 34 [2018-04-11 15:41:17,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:17,771 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 16 treesize of output 13 [2018-04-11 15:41:17,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:17,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:17,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:26 [2018-04-11 15:41:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:17,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:17,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 15:41:17,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:41:17,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:41:17,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:41:17,816 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 8 states. [2018-04-11 15:41:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:18,115 INFO L93 Difference]: Finished difference Result 268 states and 295 transitions. [2018-04-11 15:41:18,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:41:18,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-04-11 15:41:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:18,115 INFO L225 Difference]: With dead ends: 268 [2018-04-11 15:41:18,115 INFO L226 Difference]: Without dead ends: 268 [2018-04-11 15:41:18,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:41:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-11 15:41:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 185. [2018-04-11 15:41:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 15:41:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 203 transitions. [2018-04-11 15:41:18,118 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 203 transitions. Word has length 55 [2018-04-11 15:41:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:18,119 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 203 transitions. [2018-04-11 15:41:18,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:41:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 203 transitions. [2018-04-11 15:41:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:41:18,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:18,119 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:18,120 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1907155547, now seen corresponding path program 1 times [2018-04-11 15:41:18,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:18,120 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:18,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:18,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:41:18,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:18,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:18,133 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:18,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:18,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:18,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:18,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:18,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:18,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:41:18,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:41:18,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 15:41:18,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:18,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:18,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:41:18,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 15:41:18,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 15:41:18,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:41:18,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 15:41:18,361 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 32 treesize of output 33 [2018-04-11 15:41:18,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:41:18,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:41:18,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:41:18,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2018-04-11 15:41:18,449 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 9 treesize of output 1 [2018-04-11 15:41:18,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:18,504 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 70 treesize of output 72 [2018-04-11 15:41:18,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,519 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 4 case distinctions, treesize of input 32 treesize of output 61 [2018-04-11 15:41:18,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 15:41:18,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:18,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:18,589 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 83 treesize of output 87 [2018-04-11 15:41:18,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 74 [2018-04-11 15:41:18,597 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,609 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:18,611 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 83 treesize of output 87 [2018-04-11 15:41:18,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:18,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 105 [2018-04-11 15:41:18,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 86 [2018-04-11 15:41:18,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,633 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:18,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 112 [2018-04-11 15:41:18,634 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,646 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:41:18,685 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:119, output treesize:315 [2018-04-11 15:41:18,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 145 [2018-04-11 15:41:18,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,784 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:18,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 87 [2018-04-11 15:41:18,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 128 [2018-04-11 15:41:18,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:18,927 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 36 treesize of output 62 [2018-04-11 15:41:18,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:18,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 127 [2018-04-11 15:41:19,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,045 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:19,045 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 37 treesize of output 119 [2018-04-11 15:41:19,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,160 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 110 treesize of output 111 [2018-04-11 15:41:19,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:19,167 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 35 treesize of output 63 [2018-04-11 15:41:19,167 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,185 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 127 [2018-04-11 15:41:19,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,268 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 77 treesize of output 94 [2018-04-11 15:41:19,268 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,294 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 124 [2018-04-11 15:41:19,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,378 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 65 [2018-04-11 15:41:19,379 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:41:19,403 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:41:19,462 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:393, output treesize:421 [2018-04-11 15:41:19,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 176 [2018-04-11 15:41:19,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 221 [2018-04-11 15:41:19,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,700 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:19,711 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 194 treesize of output 174 [2018-04-11 15:41:19,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 122 [2018-04-11 15:41:19,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:19,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:19,825 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 252 treesize of output 203 [2018-04-11 15:41:19,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 210 [2018-04-11 15:41:19,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:19,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 125 [2018-04-11 15:41:19,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:19,938 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 134 [2018-04-11 15:41:19,939 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:41:19,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:41:20,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:20,095 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:20,097 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 149 treesize of output 160 [2018-04-11 15:41:20,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,099 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:20,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 102 [2018-04-11 15:41:20,099 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:20,118 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:20,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,120 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:20,121 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:20,123 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 142 treesize of output 153 [2018-04-11 15:41:20,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,125 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:20,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 102 [2018-04-11 15:41:20,126 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:20,144 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:20,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 184 [2018-04-11 15:41:20,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,243 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 186 [2018-04-11 15:41:20,244 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:20,259 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:20,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-11 15:41:20,344 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:603, output treesize:664 [2018-04-11 15:41:20,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 143 [2018-04-11 15:41:20,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,807 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2018-04-11 15:41:20,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-11 15:41:20,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 153 [2018-04-11 15:41:20,946 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 15:41:20,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 32 xjuncts. [2018-04-11 15:41:20,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:20,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 157 [2018-04-11 15:41:21,014 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 15:41:21,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 64 xjuncts. [2018-04-11 15:41:21,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 117 [2018-04-11 15:41:21,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-11 15:41:21,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:21,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 157 [2018-04-11 15:41:21,076 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 15:41:21,080 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-04-11 15:41:22,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-04-11 15:41:22,317 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 77 [2018-04-11 15:41:22,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,348 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 24 treesize of output 19 [2018-04-11 15:41:22,348 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,364 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,380 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2018-04-11 15:41:22,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:22,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 60 [2018-04-11 15:41:22,392 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,414 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 38 treesize of output 20 [2018-04-11 15:41:22,414 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,416 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 31 treesize of output 13 [2018-04-11 15:41:22,416 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,429 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,431 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 77 [2018-04-11 15:41:22,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,433 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 24 treesize of output 19 [2018-04-11 15:41:22,433 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,450 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,460 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,464 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 82 treesize of output 66 [2018-04-11 15:41:22,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:22,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 60 [2018-04-11 15:41:22,481 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,512 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 31 treesize of output 13 [2018-04-11 15:41:22,512 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,514 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 38 treesize of output 20 [2018-04-11 15:41:22,514 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,528 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,530 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 93 treesize of output 77 [2018-04-11 15:41:22,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,532 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 24 treesize of output 19 [2018-04-11 15:41:22,532 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,548 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,558 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,560 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 93 treesize of output 77 [2018-04-11 15:41:22,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,562 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 24 treesize of output 19 [2018-04-11 15:41:22,562 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,579 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,588 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,593 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 82 treesize of output 66 [2018-04-11 15:41:22,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,595 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 24 treesize of output 19 [2018-04-11 15:41:22,595 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-04-11 15:41:22,616 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,628 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,630 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 77 [2018-04-11 15:41:22,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,633 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 24 treesize of output 19 [2018-04-11 15:41:22,633 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,653 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,663 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,665 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 93 treesize of output 77 [2018-04-11 15:41:22,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,667 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 24 treesize of output 19 [2018-04-11 15:41:22,667 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,684 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,694 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,696 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 82 treesize of output 70 [2018-04-11 15:41:22,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,698 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 24 treesize of output 19 [2018-04-11 15:41:22,699 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-04-11 15:41:22,722 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,735 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:22,737 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 77 [2018-04-11 15:41:22,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:22,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-11 15:41:22,742 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,756 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 24 treesize of output 10 [2018-04-11 15:41:22,756 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,765 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,767 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 93 treesize of output 77 [2018-04-11 15:41:22,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,769 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 24 treesize of output 19 [2018-04-11 15:41:22,769 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:22,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-11 15:41:22,785 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:22,794 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 154 [2018-04-11 15:41:23,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 48 [2018-04-11 15:41:23,025 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:23,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,050 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 72 treesize of output 44 [2018-04-11 15:41:23,050 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,052 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2018-04-11 15:41:23,052 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,073 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:23,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-04-11 15:41:23,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,366 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 85 [2018-04-11 15:41:23,366 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 15:41:23,372 INFO L267 ElimStorePlain]: Start of recursive call 51: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 31 xjuncts. [2018-04-11 15:41:23,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:41:23,454 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 15:41:23,460 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:23,470 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 71 [2018-04-11 15:41:23,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,520 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 30 treesize of output 93 [2018-04-11 15:41:23,521 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-11 15:41:23,530 INFO L267 ElimStorePlain]: Start of recursive call 55: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 62 xjuncts. [2018-04-11 15:41:23,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:41:23,674 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,679 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 42 [2018-04-11 15:41:23,680 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:23,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-11 15:41:23,681 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:23,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:23,686 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 35 [2018-04-11 15:41:23,686 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:23,712 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:23,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:41:23,912 INFO L202 ElimStorePlain]: Needed 59 recursive calls to eliminate 9 variables, input treesize:375, output treesize:132 [2018-04-11 15:41:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:24,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:24,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:41:24,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:41:24,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:41:24,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:41:24,079 INFO L87 Difference]: Start difference. First operand 185 states and 203 transitions. Second operand 23 states. [2018-04-11 15:41:24,711 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 77 DAG size of output 77 [2018-04-11 15:41:24,989 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 142 DAG size of output 140 [2018-04-11 15:41:25,316 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 204 DAG size of output 202 [2018-04-11 15:41:25,560 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 142 DAG size of output 140 [2018-04-11 15:41:25,819 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 144 DAG size of output 142 [2018-04-11 15:41:26,024 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 144 DAG size of output 142 [2018-04-11 15:41:26,467 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 147 DAG size of output 145 [2018-04-11 15:41:26,683 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 159 DAG size of output 154 [2018-04-11 15:41:26,864 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 155 DAG size of output 150 [2018-04-11 15:41:27,047 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 155 DAG size of output 146 [2018-04-11 15:41:27,262 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 151 DAG size of output 143 [2018-04-11 15:41:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:27,541 INFO L93 Difference]: Finished difference Result 337 states and 363 transitions. [2018-04-11 15:41:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:41:27,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-04-11 15:41:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:27,542 INFO L225 Difference]: With dead ends: 337 [2018-04-11 15:41:27,543 INFO L226 Difference]: Without dead ends: 337 [2018-04-11 15:41:27,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=374, Invalid=1978, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:41:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-11 15:41:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 220. [2018-04-11 15:41:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 15:41:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-04-11 15:41:27,545 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 57 [2018-04-11 15:41:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:27,546 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-04-11 15:41:27,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:41:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-04-11 15:41:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:41:27,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:27,546 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:27,547 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1007721596, now seen corresponding path program 1 times [2018-04-11 15:41:27,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:27,547 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:27,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:27,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:27,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:27,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:27,559 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:27,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:27,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:27,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:27,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:27,669 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 19 treesize of output 24 [2018-04-11 15:41:27,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:27,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:27,691 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 15 treesize of output 18 [2018-04-11 15:41:27,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:27,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:41:27,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-04-11 15:41:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 15:41:27,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:27,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 15:41:27,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:41:27,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:41:27,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:41:27,731 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 8 states. [2018-04-11 15:41:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:27,897 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2018-04-11 15:41:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:41:27,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-04-11 15:41:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:27,898 INFO L225 Difference]: With dead ends: 257 [2018-04-11 15:41:27,898 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 15:41:27,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:41:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 15:41:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2018-04-11 15:41:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 15:41:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-04-11 15:41:27,901 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 58 [2018-04-11 15:41:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:27,901 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-04-11 15:41:27,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:41:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-04-11 15:41:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:41:27,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:27,902 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:27,902 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1701339320, now seen corresponding path program 1 times [2018-04-11 15:41:27,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:27,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:27,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:27,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:27,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:27,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:27,911 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:27,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:27,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:27,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:27,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:27,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:27,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:27,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:27,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:41:27,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:27,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:27,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:41:27,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:27,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:27,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:41:27,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:27,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:27,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:27,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-04-11 15:41:28,021 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 47 treesize of output 41 [2018-04-11 15:41:28,022 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-11 15:41:28,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:28,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-11 15:41:28,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-11 15:41:28,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-11 15:41:28,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:41:28,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,084 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-04-11 15:41:28,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:28,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:41:28,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:28,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 15:41:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:28,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:28,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:41:28,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:41:28,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:41:28,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:41:28,125 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 14 states. [2018-04-11 15:41:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:28,503 INFO L93 Difference]: Finished difference Result 309 states and 336 transitions. [2018-04-11 15:41:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:41:28,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-04-11 15:41:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:28,504 INFO L225 Difference]: With dead ends: 309 [2018-04-11 15:41:28,504 INFO L226 Difference]: Without dead ends: 309 [2018-04-11 15:41:28,504 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:41:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-11 15:41:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 280. [2018-04-11 15:41:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-11 15:41:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 314 transitions. [2018-04-11 15:41:28,508 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 314 transitions. Word has length 58 [2018-04-11 15:41:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:28,508 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 314 transitions. [2018-04-11 15:41:28,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:41:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 314 transitions. [2018-04-11 15:41:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:41:28,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:28,509 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:28,509 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1701339321, now seen corresponding path program 1 times [2018-04-11 15:41:28,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:28,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:28,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:28,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:28,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:28,529 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:28,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:28,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:28,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:28,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:28,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:41:28,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:28,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:28,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:41:28,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 15:41:28,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:28,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 10 treesize of output 9 [2018-04-11 15:41:28,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:28,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:28,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 15:41:28,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 15:41:28,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:41:28,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 15:41:28,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:41:28,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:57 [2018-04-11 15:41:28,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-11 15:41:28,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:28,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 15:41:28,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,715 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 26 treesize of output 24 [2018-04-11 15:41:28,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:28,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 15:41:28,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:28,723 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:9 [2018-04-11 15:41:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:28,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:28,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 15:41:28,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:41:28,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:41:28,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:41:28,745 INFO L87 Difference]: Start difference. First operand 280 states and 314 transitions. Second operand 12 states. [2018-04-11 15:41:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:29,112 INFO L93 Difference]: Finished difference Result 330 states and 360 transitions. [2018-04-11 15:41:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:41:29,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-11 15:41:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:29,113 INFO L225 Difference]: With dead ends: 330 [2018-04-11 15:41:29,113 INFO L226 Difference]: Without dead ends: 330 [2018-04-11 15:41:29,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:41:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-11 15:41:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 302. [2018-04-11 15:41:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-11 15:41:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 346 transitions. [2018-04-11 15:41:29,116 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 346 transitions. Word has length 58 [2018-04-11 15:41:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:29,116 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 346 transitions. [2018-04-11 15:41:29,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:41:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 346 transitions. [2018-04-11 15:41:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:41:29,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:29,117 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:29,117 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1201910742, now seen corresponding path program 1 times [2018-04-11 15:41:29,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:29,118 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:29,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:29,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:29,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:29,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:29,142 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:29,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:29,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:29,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:29,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:29,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:29,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:29,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:41:29,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 15:41:29,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:29,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:29,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:41:29,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 15:41:29,232 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-11 15:41:29,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:41:29,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2018-04-11 15:41:29,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-04-11 15:41:29,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:41:29,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-11 15:41:29,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,269 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:4 [2018-04-11 15:41:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:29,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:29,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 15:41:29,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:41:29,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:41:29,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:41:29,285 INFO L87 Difference]: Start difference. First operand 302 states and 346 transitions. Second operand 10 states. [2018-04-11 15:41:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:29,589 INFO L93 Difference]: Finished difference Result 327 states and 356 transitions. [2018-04-11 15:41:29,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:41:29,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-04-11 15:41:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:29,590 INFO L225 Difference]: With dead ends: 327 [2018-04-11 15:41:29,590 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 15:41:29,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:41:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 15:41:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-04-11 15:41:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-11 15:41:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 344 transitions. [2018-04-11 15:41:29,592 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 344 transitions. Word has length 59 [2018-04-11 15:41:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:29,593 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 344 transitions. [2018-04-11 15:41:29,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:41:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 344 transitions. [2018-04-11 15:41:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:41:29,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:29,593 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:29,593 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1395450630, now seen corresponding path program 1 times [2018-04-11 15:41:29,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:29,593 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:29,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:29,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:29,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:29,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:29,607 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:29,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:29,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:29,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:29,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:29,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:41:29,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:29,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:29,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:29,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:41:29,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 15:41:29,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:29,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:29,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:29,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:29,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-11 15:41:29,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 15:41:29,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 14 treesize of output 13 [2018-04-11 15:41:29,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-11 15:41:29,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:41:29,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:57 [2018-04-11 15:41:29,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-11 15:41:29,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:29,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 15:41:29,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,829 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 26 treesize of output 24 [2018-04-11 15:41:29,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:41:29,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 15:41:29,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:29,841 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:9 [2018-04-11 15:41:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:41:29,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:41:29,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 15:41:29,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:41:29,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:41:29,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:41:29,884 INFO L87 Difference]: Start difference. First operand 302 states and 344 transitions. Second operand 12 states. [2018-04-11 15:41:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:41:30,375 INFO L93 Difference]: Finished difference Result 359 states and 394 transitions. [2018-04-11 15:41:30,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:41:30,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-11 15:41:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:41:30,376 INFO L225 Difference]: With dead ends: 359 [2018-04-11 15:41:30,376 INFO L226 Difference]: Without dead ends: 359 [2018-04-11 15:41:30,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:41:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-11 15:41:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 299. [2018-04-11 15:41:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-11 15:41:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 341 transitions. [2018-04-11 15:41:30,384 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 341 transitions. Word has length 60 [2018-04-11 15:41:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:41:30,384 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 341 transitions. [2018-04-11 15:41:30,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:41:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 341 transitions. [2018-04-11 15:41:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:41:30,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:41:30,385 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:41:30,385 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:41:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1357207938, now seen corresponding path program 1 times [2018-04-11 15:41:30,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:41:30,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:41:30,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:30,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:30,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:41:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:30,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:41:30,396 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:41:30,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:41:30,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:41:30,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:41:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:41:30,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:41:30,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:30,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:30,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 15:41:30,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:41:30,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,443 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-11 15:41:30,454 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 18 [2018-04-11 15:41:30,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,458 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 18 treesize of output 27 [2018-04-11 15:41:30,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,473 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 18 [2018-04-11 15:41:30,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,476 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 18 treesize of output 27 [2018-04-11 15:41:30,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-11 15:41:30,510 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 30 treesize of output 23 [2018-04-11 15:41:30,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:41:30,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,530 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 30 treesize of output 23 [2018-04-11 15:41:30,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,534 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 23 treesize of output 46 [2018-04-11 15:41:30,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 15:41:30,555 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 39 treesize of output 30 [2018-04-11 15:41:30,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-11 15:41:30,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,592 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 39 treesize of output 30 [2018-04-11 15:41:30,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-11 15:41:30,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-11 15:41:30,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:41:30,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-04-11 15:41:30,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 52 [2018-04-11 15:41:30,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 109 [2018-04-11 15:41:30,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-04-11 15:41:30,855 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 43 treesize of output 42 [2018-04-11 15:41:30,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:30,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:41:30,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2018-04-11 15:41:30,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:30,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:31,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 112 [2018-04-11 15:41:31,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 16 xjuncts. [2018-04-11 15:41:31,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-04-11 15:41:31,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:31,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:41:31,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 25 xjuncts. [2018-04-11 15:41:31,290 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:1940 [2018-04-11 15:41:31,492 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-04-11 15:41:31,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 114 [2018-04-11 15:41:31,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-04-11 15:41:31,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:31,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:32,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 112 [2018-04-11 15:41:32,058 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 105 treesize of output 104 [2018-04-11 15:41:32,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:32,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:32,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 122 [2018-04-11 15:41:32,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 136 [2018-04-11 15:41:32,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:32,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:32,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 177 [2018-04-11 15:41:32,531 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-11 15:41:32,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:33,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 112 [2018-04-11 15:41:33,038 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 105 treesize of output 104 [2018-04-11 15:41:33,038 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:33,092 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:33,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 122 [2018-04-11 15:41:33,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 136 [2018-04-11 15:41:33,475 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:33,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:33,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 187 [2018-04-11 15:41:33,569 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 6 xjuncts. [2018-04-11 15:41:33,705 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:34,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 112 [2018-04-11 15:41:34,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2018-04-11 15:41:34,124 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:34,172 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:34,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 122 [2018-04-11 15:41:34,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:34,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 177 [2018-04-11 15:41:34,556 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-04-11 15:41:34,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-04-11 15:41:34,699 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:34,770 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:35,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 124 [2018-04-11 15:41:35,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 170 [2018-04-11 15:41:35,182 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:35,259 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 129 treesize of output 128 [2018-04-11 15:41:35,260 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:35,300 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:35,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 124 [2018-04-11 15:41:35,636 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 119 treesize of output 118 [2018-04-11 15:41:35,637 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:35,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:35,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 189 [2018-04-11 15:41:35,723 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-04-11 15:41:35,832 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:41:36,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 151 [2018-04-11 15:41:36,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 192 [2018-04-11 15:41:36,243 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:36,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 184 [2018-04-11 15:41:36,374 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:36,418 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:41:36,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 114 treesize of output 149 [2018-04-11 15:41:36,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 136 [2018-04-11 15:41:36,443 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:36,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:36,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 203 [2018-04-11 15:41:36,607 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 16 xjuncts. [2018-04-11 15:41:36,893 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 124 [2018-04-11 15:41:36,894 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:37,113 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:41:37,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 145 [2018-04-11 15:41:37,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:37,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 190 [2018-04-11 15:41:37,144 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 15:41:37,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,231 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:37,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:41:37,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:41:37,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 186 [2018-04-11 15:41:37,249 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-11 15:41:37,322 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:41:37,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 10 dim-2 vars, End of recursive call: 17 dim-0 vars, and 15 xjuncts. [2018-04-11 15:41:37,784 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 20 variables, input treesize:537, output treesize:1627 [2018-04-11 15:42:18,484 WARN L151 SmtUtils]: Spent 40645ms on a formula simplification. DAG size of input: 302 DAG size of output 284 [2018-04-11 15:42:18,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 165 [2018-04-11 15:42:18,536 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 153 treesize of output 152 [2018-04-11 15:42:18,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:42:18,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:18,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 212 [2018-04-11 15:42:18,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 15:42:19,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 143 [2018-04-11 15:42:19,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:42:19,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:19,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:19,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:19,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:19,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:19,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:42:19,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 205 [2018-04-11 15:42:19,385 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-11 15:42:19,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:43:34,778 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:43:34,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2018-04-11 15:43:34,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:43:34,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:43:34,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:43:34,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:43:34,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:43:34,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:43:34,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 94 [2018-04-11 15:43:34,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:43:34,817 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-11 15:44:29,853 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 15:44:29,853 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:44:29,856 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:44:29,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:44:29 BoogieIcfgContainer [2018-04-11 15:44:29,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:44:29,857 INFO L168 Benchmark]: Toolchain (without parser) took 209033.23 ms. Allocated memory was 401.6 MB in the beginning and 1.0 GB in the end (delta: 612.9 MB). Free memory was 333.7 MB in the beginning and 476.6 MB in the end (delta: -142.9 MB). Peak memory consumption was 563.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:44:29,857 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 401.6 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:44:29,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.41 ms. Allocated memory is still 401.6 MB. Free memory was 332.4 MB in the beginning and 308.6 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:44:29,858 INFO L168 Benchmark]: Boogie Preprocessor took 39.99 ms. Allocated memory is still 401.6 MB. Free memory was 308.6 MB in the beginning and 306.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:44:29,858 INFO L168 Benchmark]: RCFGBuilder took 659.41 ms. Allocated memory was 401.6 MB in the beginning and 586.7 MB in the end (delta: 185.1 MB). Free memory was 306.0 MB in the beginning and 513.4 MB in the end (delta: -207.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:44:29,858 INFO L168 Benchmark]: TraceAbstraction took 208086.92 ms. Allocated memory was 586.7 MB in the beginning and 1.0 GB in the end (delta: 427.8 MB). Free memory was 513.4 MB in the beginning and 476.6 MB in the end (delta: 36.8 MB). Peak memory consumption was 558.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:44:29,859 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.20 ms. Allocated memory is still 401.6 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.41 ms. Allocated memory is still 401.6 MB. Free memory was 332.4 MB in the beginning and 308.6 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.99 ms. Allocated memory is still 401.6 MB. Free memory was 308.6 MB in the beginning and 306.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 659.41 ms. Allocated memory was 401.6 MB in the beginning and 586.7 MB in the end (delta: 185.1 MB). Free memory was 306.0 MB in the beginning and 513.4 MB in the end (delta: -207.4 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 208086.92 ms. Allocated memory was 586.7 MB in the beginning and 1.0 GB in the end (delta: 427.8 MB). Free memory was 513.4 MB in the beginning and 476.6 MB in the end (delta: 36.8 MB). Peak memory consumption was 558.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 518. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 39 error locations. TIMEOUT Result, 208.0s OverallTime, 39 OverallIterations, 3 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2778 SDtfs, 7790 SDslu, 9924 SDs, 0 SdLazy, 9766 SolverSat, 641 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1350 GetRequests, 855 SyntacticMatches, 9 SemanticMatches, 486 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 2030 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1501 ConstructedInterpolants, 167 QuantifiedInterpolants, 1251988 SizeOfPredicates, 210 NumberOfNonLiveVariables, 4009 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 39 InterpolantComputations, 21 PerfectInterpolantSequences, 148/321 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/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-44-29-864.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-44-29-864.csv Completed graceful shutdown