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/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:40:53,738 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:40:53,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:40:53,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:40:53,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:40:53,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:40:53,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:40:53,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:40:53,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:40:53,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:40:53,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:40:53,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:40:53,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:40:53,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:40:53,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:40:53,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:40:53,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:40:53,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:40:53,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:40:53,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:40:53,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:40:53,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:40:53,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:40:53,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:40:53,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:40:53,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:40:53,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:40:53,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:40:53,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:40:53,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:40:53,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:40:53,771 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 17:40:53,789 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:40:53,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:40:53,790 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:40:53,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:40:53,791 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:40:53,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:40:53,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:40:53,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:40:53,793 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 17:40:53,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:40:53,827 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:40:53,829 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:40:53,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:40:53,831 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:40:53,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,112 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG23f6958fe [2018-04-11 17:40:54,290 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:40:54,290 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:40:54,290 INFO L168 CDTParser]: Scanning dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,298 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:40:54,299 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:40:54,299 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:40:54,299 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,299 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:40:54,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__register_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__timer_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__off_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____mode_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__id_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__gid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_short in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__uint in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__mode_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__SLL in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____clock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_short in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__dev_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__time_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_int in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____loff_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ino_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ushort in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____time_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__loff_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ulong in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_long in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_char in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____off_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_long in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____dev_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fd_set in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__clock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ino_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__div_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__uid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__size_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____gid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____id_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____timer_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____pid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_char in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____off64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,309 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:54,323 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG23f6958fe [2018-04-11 17:40:54,326 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:40:54,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:40:54,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:40:54,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:40:54,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:40:54,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13af7734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54, skipping insertion in model container [2018-04-11 17:40:54,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,344 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:40:54,366 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:40:54,488 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:40:54,524 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:40:54,529 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 17:40:54,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54 WrapperNode [2018-04-11 17:40:54,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:40:54,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:40:54,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:40:54,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:40:54,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (1/1) ... [2018-04-11 17:40:54,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:40:54,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:40:54,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:40:54,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:40:54,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (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 17:40:54,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:40:54,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:40:54,706 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 17:40:54,706 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 17:40:54,707 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 17:40:54,708 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 17:40:54,709 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 17:40:54,710 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 17:40:54,711 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 17:40:54,712 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 17:40:54,713 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 17:40:54,714 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 17:40:54,715 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:40:54,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:40:54,717 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:40:54,717 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:40:54,717 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:40:55,087 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:40:55,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:40:55 BoogieIcfgContainer [2018-04-11 17:40:55,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:40:55,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:40:55,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:40:55,090 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:40:55,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:40:54" (1/3) ... [2018-04-11 17:40:55,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4024a0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:40:55, skipping insertion in model container [2018-04-11 17:40:55,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:40:54" (2/3) ... [2018-04-11 17:40:55,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4024a0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:40:55, skipping insertion in model container [2018-04-11 17:40:55,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:40:55" (3/3) ... [2018-04-11 17:40:55,092 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:40:55,097 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:40:55,101 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-11 17:40:55,124 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:40:55,125 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:40:55,125 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:40:55,125 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:40:55,125 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:40:55,125 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:40:55,125 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:40:55,125 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:40:55,125 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:40:55,126 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:40:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-04-11 17:40:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:40:55,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:55,142 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:55,142 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1243505339, now seen corresponding path program 1 times [2018-04-11 17:40:55,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:55,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:55,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:55,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:55,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:55,248 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 17:40:55,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:55,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:40:55,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:40:55,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:40:55,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:40:55,261 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 4 states. [2018-04-11 17:40:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:55,404 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-04-11 17:40:55,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:40:55,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:40:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:55,411 INFO L225 Difference]: With dead ends: 162 [2018-04-11 17:40:55,411 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 17:40:55,412 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 17:40:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 17:40:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 131. [2018-04-11 17:40:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 17:40:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-04-11 17:40:55,440 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 8 [2018-04-11 17:40:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:55,440 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-04-11 17:40:55,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:40:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-04-11 17:40:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:40:55,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:55,441 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:55,441 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1243505338, now seen corresponding path program 1 times [2018-04-11 17:40:55,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:55,441 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:55,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:55,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:55,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:55,491 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 17:40:55,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:55,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:40:55,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:40:55,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:40:55,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:40:55,493 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 4 states. [2018-04-11 17:40:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:55,599 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-04-11 17:40:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:40:55,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:40:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:55,600 INFO L225 Difference]: With dead ends: 156 [2018-04-11 17:40:55,600 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 17:40:55,601 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 17:40:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 17:40:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2018-04-11 17:40:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 17:40:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-04-11 17:40:55,608 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 8 [2018-04-11 17:40:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:55,608 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-04-11 17:40:55,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:40:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-04-11 17:40:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 17:40:55,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:55,609 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:55,609 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:55,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1332672851, now seen corresponding path program 1 times [2018-04-11 17:40:55,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:55,610 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:55,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:55,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:55,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:55,646 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 17:40:55,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:55,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:40:55,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:40:55,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:40:55,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:40:55,647 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 4 states. [2018-04-11 17:40:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:55,759 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-04-11 17:40:55,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:40:55,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 17:40:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:55,760 INFO L225 Difference]: With dead ends: 132 [2018-04-11 17:40:55,760 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 17:40:55,760 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 17:40:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 17:40:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2018-04-11 17:40:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 17:40:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-04-11 17:40:55,766 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 15 [2018-04-11 17:40:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:55,767 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-04-11 17:40:55,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:40:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-04-11 17:40:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 17:40:55,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:55,767 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:55,767 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1332672852, now seen corresponding path program 1 times [2018-04-11 17:40:55,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:55,768 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:55,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:55,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:55,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:55,822 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 17:40:55,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:55,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:40:55,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:40:55,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:40:55,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:40:55,823 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 5 states. [2018-04-11 17:40:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:55,969 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-04-11 17:40:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:40:55,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 17:40:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:55,970 INFO L225 Difference]: With dead ends: 205 [2018-04-11 17:40:55,970 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 17:40:55,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:40:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 17:40:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2018-04-11 17:40:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 17:40:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-11 17:40:55,978 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 15 [2018-04-11 17:40:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:55,979 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-11 17:40:55,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:40:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-11 17:40:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:40:55,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:55,979 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:55,980 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1020098763, now seen corresponding path program 1 times [2018-04-11 17:40:55,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:55,980 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:55,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:55,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:55,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:56,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:56,025 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 17:40:56,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:56,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:40:56,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:40:56,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:40:56,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:40:56,026 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 5 states. [2018-04-11 17:40:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:56,175 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-04-11 17:40:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:40:56,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 17:40:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:56,176 INFO L225 Difference]: With dead ends: 225 [2018-04-11 17:40:56,176 INFO L226 Difference]: Without dead ends: 225 [2018-04-11 17:40:56,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:40:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-11 17:40:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 157. [2018-04-11 17:40:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 17:40:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-04-11 17:40:56,180 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 18 [2018-04-11 17:40:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:56,180 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-04-11 17:40:56,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:40:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-04-11 17:40:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:40:56,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:56,181 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:56,181 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1020098762, now seen corresponding path program 1 times [2018-04-11 17:40:56,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:56,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:56,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:56,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:56,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:56,219 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 17:40:56,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:56,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:40:56,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:40:56,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:40:56,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:40:56,220 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 5 states. [2018-04-11 17:40:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:56,400 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-04-11 17:40:56,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:40:56,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 17:40:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:56,401 INFO L225 Difference]: With dead ends: 255 [2018-04-11 17:40:56,401 INFO L226 Difference]: Without dead ends: 255 [2018-04-11 17:40:56,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:40:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-11 17:40:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 156. [2018-04-11 17:40:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 17:40:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-04-11 17:40:56,408 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 18 [2018-04-11 17:40:56,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:56,409 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-04-11 17:40:56,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:40:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-04-11 17:40:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 17:40:56,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:56,409 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:56,410 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:56,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1578271401, now seen corresponding path program 1 times [2018-04-11 17:40:56,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:56,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:56,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:56,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:56,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:56,447 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 17:40:56,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:56,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:40:56,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:40:56,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:40:56,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:40:56,447 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 5 states. [2018-04-11 17:40:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:56,524 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-04-11 17:40:56,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:40:56,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-11 17:40:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:56,525 INFO L225 Difference]: With dead ends: 159 [2018-04-11 17:40:56,525 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 17:40:56,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:40:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 17:40:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-04-11 17:40:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 17:40:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2018-04-11 17:40:56,528 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 19 [2018-04-11 17:40:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:56,528 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2018-04-11 17:40:56,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:40:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2018-04-11 17:40:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 17:40:56,529 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:56,529 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:56,529 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:56,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1578271400, now seen corresponding path program 1 times [2018-04-11 17:40:56,529 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:56,529 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:56,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:56,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:56,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:56,575 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 17:40:56,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:56,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:40:56,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:40:56,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:40:56,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:40:56,575 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 5 states. [2018-04-11 17:40:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:56,677 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-04-11 17:40:56,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:40:56,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-11 17:40:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:56,678 INFO L225 Difference]: With dead ends: 154 [2018-04-11 17:40:56,678 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 17:40:56,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:40:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 17:40:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-11 17:40:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 17:40:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-04-11 17:40:56,682 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 19 [2018-04-11 17:40:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:56,682 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-04-11 17:40:56,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:40:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-04-11 17:40:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:40:56,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:56,683 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:56,683 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:56,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1276271173, now seen corresponding path program 1 times [2018-04-11 17:40:56,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:56,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:56,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:56,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:56,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:56,703 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:40:56,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:40:56,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:40:56,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:56,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:40:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:56,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:56,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:40:56,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 17:40:56,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:40:56,812 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 17:40:56,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,820 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 17:40:56,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 17:40:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 17:40:56,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:56,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,850 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 17:40:56,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 17:40:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-11 17:40:56,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 17:40:56,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,872 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 17:40:56,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:56,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:40:56,879 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 17:40:56,890 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 17:40:56,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:56,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 17:40:56,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:40:56,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:40:56,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:40:56,891 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 8 states. [2018-04-11 17:40:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:57,101 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-04-11 17:40:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:40:57,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 17:40:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:57,102 INFO L225 Difference]: With dead ends: 153 [2018-04-11 17:40:57,102 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 17:40:57,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:40:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 17:40:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-11 17:40:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 17:40:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-04-11 17:40:57,105 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 22 [2018-04-11 17:40:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:57,106 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-04-11 17:40:57,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:40:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-04-11 17:40:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:40:57,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:57,106 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:57,107 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1276271172, now seen corresponding path program 1 times [2018-04-11 17:40:57,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:57,107 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:57,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:57,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:57,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:57,120 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:40:57,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:40:57,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:40:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:57,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:40:57,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:57,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:57,158 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 17:40:57,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:40:57,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 17:40:57,172 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 17:40:57,173 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 17:40:57,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:40:57,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:40:57,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,192 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 17:40:57,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 17:40:57,208 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 9 treesize of output 1 [2018-04-11 17:40:57,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,223 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 29 treesize of output 30 [2018-04-11 17:40:57,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:57,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,237 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 52 treesize of output 48 [2018-04-11 17:40:57,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:57,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:40:57,248 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:76, output treesize:51 [2018-04-11 17:40:57,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-11 17:40:57,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 17:40:57,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,272 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 17:40:57,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-11 17:40:57,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:40:57,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,286 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 17:40:57,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,289 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 17:40:57,295 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 17:40:57,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:57,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 17:40:57,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:40:57,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:40:57,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:40:57,296 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 8 states. [2018-04-11 17:40:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:57,522 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-04-11 17:40:57,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:40:57,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 17:40:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:57,522 INFO L225 Difference]: With dead ends: 152 [2018-04-11 17:40:57,522 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 17:40:57,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:40:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 17:40:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-04-11 17:40:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 17:40:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-04-11 17:40:57,525 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 22 [2018-04-11 17:40:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:57,525 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-04-11 17:40:57,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:40:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-04-11 17:40:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:40:57,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:57,525 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:57,525 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1266958903, now seen corresponding path program 1 times [2018-04-11 17:40:57,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:57,526 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:57,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:57,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:57,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:57,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:57,536 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:40:57,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:40:57,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:40:57,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:57,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:40:57,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:40:57,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 17:40:57,587 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 17:40:57,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:57,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:40:57,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:40:57,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,636 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 17:40:57,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-11 17:40:57,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:40:57,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:40:57,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-11 17:40:57,682 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 35 [2018-04-11 17:40:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:57,688 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 21 treesize of output 28 [2018-04-11 17:40:57,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:40:57,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,707 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 17:40:57,707 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-11 17:40:57,730 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-11 17:40:57,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 17:40:57,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 17:40:57,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:57,752 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 17:40:57,752 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-11 17:40:57,767 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 17:40:57,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:57,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 17:40:57,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:40:57,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:40:57,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:40:57,768 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 11 states. [2018-04-11 17:40:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:58,075 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2018-04-11 17:40:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 17:40:58,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-11 17:40:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:58,076 INFO L225 Difference]: With dead ends: 161 [2018-04-11 17:40:58,076 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 17:40:58,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:40:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 17:40:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-04-11 17:40:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 17:40:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2018-04-11 17:40:58,079 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 22 [2018-04-11 17:40:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:58,079 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2018-04-11 17:40:58,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:40:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2018-04-11 17:40:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:40:58,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:58,080 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:40:58,080 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1266958904, now seen corresponding path program 1 times [2018-04-11 17:40:58,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:58,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:58,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:58,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:58,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:58,091 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:40:58,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:40:58,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:40:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:58,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:40:58,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:58,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 17:40:58,148 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 17:40:58,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:58,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,158 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 17:40:58,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:58,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,166 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 17:40:58,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-11 17:40:58,196 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 35 [2018-04-11 17:40:58,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:58,201 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 21 treesize of output 28 [2018-04-11 17:40:58,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:40:58,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,269 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 28 treesize of output 56 [2018-04-11 17:40:58,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:58,280 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 30 treesize of output 39 [2018-04-11 17:40:58,280 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 17:40:58,302 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:40:58,317 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:57 [2018-04-11 17:40:58,337 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-04-11 17:40:58,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:58,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2018-04-11 17:40:58,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:40:58,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-04-11 17:40:58,359 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 17:40:58,381 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 68 treesize of output 49 [2018-04-11 17:40:58,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:40:58,440 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 58 treesize of output 44 [2018-04-11 17:40:58,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2018-04-11 17:40:58,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:40:58,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 17:40:58,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,474 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 54 treesize of output 48 [2018-04-11 17:40:58,476 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 44 treesize of output 23 [2018-04-11 17:40:58,477 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 17:40:58,490 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:58,503 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-11 17:40:58,503 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,510 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,516 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 17:40:58,516 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-04-11 17:40:58,531 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 17:40:58,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:40:58,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 17:40:58,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:40:58,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:40:58,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:40:58,532 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand 11 states. [2018-04-11 17:40:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:40:58,891 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2018-04-11 17:40:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:40:58,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-11 17:40:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:40:58,892 INFO L225 Difference]: With dead ends: 170 [2018-04-11 17:40:58,892 INFO L226 Difference]: Without dead ends: 170 [2018-04-11 17:40:58,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-04-11 17:40:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-11 17:40:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 139. [2018-04-11 17:40:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 17:40:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-04-11 17:40:58,895 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 22 [2018-04-11 17:40:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:40:58,895 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-04-11 17:40:58,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:40:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-04-11 17:40:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 17:40:58,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:40:58,896 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] [2018-04-11 17:40:58,896 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:40:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1106429151, now seen corresponding path program 1 times [2018-04-11 17:40:58,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:40:58,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:40:58,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:58,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:58,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:40:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:58,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:40:58,911 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:40:58,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:40:58,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:40:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:40:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:40:58,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:40:58,975 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 17:40:58,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:58,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:58,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 17:40:59,004 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 28 treesize of output 38 [2018-04-11 17:40:59,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-11 17:40:59,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,028 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 17:40:59,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-04-11 17:40:59,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:40:59,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2018-04-11 17:40:59,109 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 17:40:59,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:40:59,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,139 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 60 treesize of output 77 [2018-04-11 17:40:59,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 67 [2018-04-11 17:40:59,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:40:59,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-04-11 17:40:59,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 49 [2018-04-11 17:40:59,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 17:40:59,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:40:59,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 17:40:59,346 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:79, output treesize:104 [2018-04-11 17:40:59,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 78 [2018-04-11 17:40:59,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-11 17:40:59,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-04-11 17:40:59,524 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 17:40:59,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,621 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2018-04-11 17:40:59,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,720 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2018-04-11 17:40:59,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,840 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2018-04-11 17:40:59,841 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,877 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 45 treesize of output 45 [2018-04-11 17:40:59,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-11 17:40:59,880 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-04-11 17:40:59,901 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:40:59,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-11 17:40:59,915 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,923 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,932 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:118, output treesize:16 [2018-04-11 17:40:59,960 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 35 [2018-04-11 17:40:59,962 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 24 treesize of output 23 [2018-04-11 17:40:59,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:40:59,978 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 17:40:59,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-11 17:40:59,998 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-11 17:40:59,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 17:41:00,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:00,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:00,006 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 17:41:00,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-11 17:41:00,030 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 17:41:00,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:00,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:41:00,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:41:00,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:41:00,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:41:00,031 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 17 states. [2018-04-11 17:41:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:00,813 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-04-11 17:41:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 17:41:00,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-11 17:41:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:00,814 INFO L225 Difference]: With dead ends: 179 [2018-04-11 17:41:00,814 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 17:41:00,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:41:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 17:41:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 127. [2018-04-11 17:41:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 17:41:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-04-11 17:41:00,818 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2018-04-11 17:41:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:00,818 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-04-11 17:41:00,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:41:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-04-11 17:41:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:41:00,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:00,819 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:00,819 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 115539414, now seen corresponding path program 1 times [2018-04-11 17:41:00,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:00,820 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:00,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:00,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:00,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:00,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:00,885 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 17:41:00,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:00,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 17:41:00,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:41:00,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:41:00,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:41:00,886 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2018-04-11 17:41:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:01,117 INFO L93 Difference]: Finished difference Result 223 states and 230 transitions. [2018-04-11 17:41:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 17:41:01,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-11 17:41:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:01,118 INFO L225 Difference]: With dead ends: 223 [2018-04-11 17:41:01,118 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 17:41:01,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-04-11 17:41:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 17:41:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2018-04-11 17:41:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 17:41:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-04-11 17:41:01,120 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 37 [2018-04-11 17:41:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:01,120 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-04-11 17:41:01,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:41:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-04-11 17:41:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:41:01,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:01,120 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:01,120 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash 115539415, now seen corresponding path program 1 times [2018-04-11 17:41:01,121 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:01,121 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:01,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:01,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:01,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:01,137 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:01,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:01,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:01,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:01,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:01,183 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 17:41:01,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:01,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-04-11 17:41:01,195 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 17:41:01,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:01,198 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 17:41:01,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 17:41:01,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:01,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-04-11 17:41:01,276 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 17:41:01,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:01,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,293 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:01,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 17:41:01,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:01,297 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 26 treesize of output 29 [2018-04-11 17:41:01,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,309 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 17:41:01,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:35 [2018-04-11 17:41:01,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 65 [2018-04-11 17:41:01,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:01,373 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 0 case distinctions, treesize of input 50 treesize of output 62 [2018-04-11 17:41:01,374 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 17:41:01,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:01,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-04-11 17:41:01,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,426 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 59 treesize of output 69 [2018-04-11 17:41:01,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-11 17:41:01,439 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,480 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:85, output treesize:69 [2018-04-11 17:41:01,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-04-11 17:41:01,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 17:41:01,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:80 [2018-04-11 17:41:01,816 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 27 treesize of output 31 [2018-04-11 17:41:01,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:01,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:41:01,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,837 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 27 treesize of output 16 [2018-04-11 17:41:01,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 17:41:01,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:01,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:01,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:87, output treesize:134 [2018-04-11 17:41:01,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-11 17:41:01,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 17:41:01,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,945 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 34 treesize of output 23 [2018-04-11 17:41:01,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-04-11 17:41:01,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-04-11 17:41:01,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,962 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 17:41:01,963 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:01,969 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 17:41:01,969 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:9 [2018-04-11 17:41:01,999 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 17:41:01,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:02,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 17:41:02,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:41:02,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:41:02,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:41:02,001 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 18 states. [2018-04-11 17:41:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:02,920 INFO L93 Difference]: Finished difference Result 244 states and 253 transitions. [2018-04-11 17:41:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:41:02,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-11 17:41:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:02,921 INFO L225 Difference]: With dead ends: 244 [2018-04-11 17:41:02,921 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 17:41:02,922 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 17:41:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 17:41:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 153. [2018-04-11 17:41:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 17:41:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-04-11 17:41:02,924 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 37 [2018-04-11 17:41:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:02,925 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-04-11 17:41:02,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:41:02,925 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-04-11 17:41:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:41:02,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:02,926 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:02,926 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1992808857, now seen corresponding path program 1 times [2018-04-11 17:41:02,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:02,926 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:02,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:02,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:02,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:02,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:02,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:02,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:03,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:03,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 6 treesize of output 5 [2018-04-11 17:41:03,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:03,062 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 17:41:03,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:03,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-04-11 17:41:03,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:03,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 25 [2018-04-11 17:41:03,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:03,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:03,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:03,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:50 [2018-04-11 17:41:03,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:41:03,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:03,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:37 [2018-04-11 17:41:03,209 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 23 treesize of output 35 [2018-04-11 17:41:03,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:03,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:03,229 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 21 treesize of output 30 [2018-04-11 17:41:03,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:03,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:03,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:03,260 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:84 [2018-04-11 17:41:03,337 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 53 treesize of output 35 [2018-04-11 17:41:03,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,356 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 44 treesize of output 26 [2018-04-11 17:41:03,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:03,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:98, output treesize:54 [2018-04-11 17:41:03,438 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 40 treesize of output 42 [2018-04-11 17:41:03,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:03,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:03,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:03,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-11 17:41:03,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,470 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 38 treesize of output 31 [2018-04-11 17:41:03,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:03,491 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 31 treesize of output 27 [2018-04-11 17:41:03,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:03,538 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 31 treesize of output 27 [2018-04-11 17:41:03,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:03,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:41:03,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:03,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:03,564 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:72, output treesize:7 [2018-04-11 17:41:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:03,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:03,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2018-04-11 17:41:03,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:41:03,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:41:03,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:41:03,586 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 18 states. [2018-04-11 17:41:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:04,862 INFO L93 Difference]: Finished difference Result 256 states and 260 transitions. [2018-04-11 17:41:04,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:41:04,862 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-11 17:41:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:04,863 INFO L225 Difference]: With dead ends: 256 [2018-04-11 17:41:04,863 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 17:41:04,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:41:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 17:41:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 153. [2018-04-11 17:41:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 17:41:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-04-11 17:41:04,865 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 37 [2018-04-11 17:41:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:04,866 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-04-11 17:41:04,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:41:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-04-11 17:41:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:41:04,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:04,866 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:04,866 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash -700426646, now seen corresponding path program 1 times [2018-04-11 17:41:04,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:04,867 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:04,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:04,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:04,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:04,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:04,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:04,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:04,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:04,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:04,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:04,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:04,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:04,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:04,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:41:04,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:04,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:04,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:04,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-11 17:41:04,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:41:04,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,974 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 17:41:04,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:41:04,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,988 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 17:41:04,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:41:04,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:04,999 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:56, output treesize:39 [2018-04-11 17:41:05,010 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 25 treesize of output 19 [2018-04-11 17:41:05,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 17:41:05,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-04-11 17:41:05,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 17:41:05,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:05,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,040 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 17:41:05,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-04-11 17:41:05,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 17:41:05,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:05,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:24 [2018-04-11 17:41:05,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-11 17:41:05,131 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:05,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:41:05,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,135 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 17:41:05,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:05,139 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 17:41:05,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:7 [2018-04-11 17:41:05,154 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 17:41:05,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:05,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 17:41:05,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:41:05,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:41:05,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-11 17:41:05,155 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 15 states. [2018-04-11 17:41:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:05,939 INFO L93 Difference]: Finished difference Result 252 states and 256 transitions. [2018-04-11 17:41:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:41:05,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-04-11 17:41:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:05,940 INFO L225 Difference]: With dead ends: 252 [2018-04-11 17:41:05,940 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 17:41:05,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 17:41:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 17:41:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 165. [2018-04-11 17:41:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 17:41:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2018-04-11 17:41:05,943 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 49 [2018-04-11 17:41:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:05,943 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2018-04-11 17:41:05,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:41:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2018-04-11 17:41:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 17:41:05,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:05,944 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:05,944 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -238389276, now seen corresponding path program 1 times [2018-04-11 17:41:05,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:05,945 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:05,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:05,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:05,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:05,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:06,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:06,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 17:41:06,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:41:06,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:41:06,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:41:06,006 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand 8 states. [2018-04-11 17:41:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:06,184 INFO L93 Difference]: Finished difference Result 206 states and 212 transitions. [2018-04-11 17:41:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:41:06,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 17:41:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:06,186 INFO L225 Difference]: With dead ends: 206 [2018-04-11 17:41:06,186 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 17:41:06,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:41:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 17:41:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2018-04-11 17:41:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 17:41:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 193 transitions. [2018-04-11 17:41:06,189 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 193 transitions. Word has length 50 [2018-04-11 17:41:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:06,190 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 193 transitions. [2018-04-11 17:41:06,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:41:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 193 transitions. [2018-04-11 17:41:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 17:41:06,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:06,190 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:06,190 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -947725780, now seen corresponding path program 1 times [2018-04-11 17:41:06,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:06,191 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:06,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:06,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:06,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:06,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:06,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:06,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:06,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:06,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:06,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:06,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:41:06,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:06,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,275 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 17:41:06,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-11 17:41:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:06,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:06,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:41:06,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:41:06,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:41:06,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:41:06,285 INFO L87 Difference]: Start difference. First operand 181 states and 193 transitions. Second operand 9 states. [2018-04-11 17:41:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:06,511 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2018-04-11 17:41:06,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:41:06,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-04-11 17:41:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:06,512 INFO L225 Difference]: With dead ends: 209 [2018-04-11 17:41:06,512 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 17:41:06,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-04-11 17:41:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 17:41:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2018-04-11 17:41:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 17:41:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-04-11 17:41:06,515 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 50 [2018-04-11 17:41:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:06,515 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-04-11 17:41:06,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:41:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-04-11 17:41:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:41:06,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:06,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:06,516 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:06,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1314925652, now seen corresponding path program 1 times [2018-04-11 17:41:06,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:06,516 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:06,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:06,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:06,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:06,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:06,531 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:06,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:06,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:06,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:06,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:06,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:06,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:06,587 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 17:41:06,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:41:06,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 17:41:06,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:06,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:06,615 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 17:41:06,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-11 17:41:06,635 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 17:41:06,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, 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 17:41:06,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,646 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 17:41:06,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 17:41:06,677 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 30 treesize of output 34 [2018-04-11 17:41:06,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:41:06,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,692 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 17:41:06,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-11 17:41:06,713 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 29 treesize of output 19 [2018-04-11 17:41:06,715 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 12 treesize of output 4 [2018-04-11 17:41:06,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,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 7 treesize of output 1 [2018-04-11 17:41:06,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,725 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 17:41:06,725 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2018-04-11 17:41:06,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 17:41:06,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:06,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-11 17:41:06,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:06,796 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 32 treesize of output 39 [2018-04-11 17:41:06,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-04-11 17:41:06,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,805 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 17:41:06,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-04-11 17:41:06,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 63 [2018-04-11 17:41:06,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:06,861 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 38 treesize of output 47 [2018-04-11 17:41:06,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:06,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-11 17:41:06,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:06,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:06,996 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 30 treesize of output 39 [2018-04-11 17:41:06,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:07,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:41:07,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:07,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:39, output treesize:88 [2018-04-11 17:41:07,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 49 [2018-04-11 17:41:07,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-11 17:41:07,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,158 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 33 treesize of output 26 [2018-04-11 17:41:07,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,197 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 29 treesize of output 36 [2018-04-11 17:41:07,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,236 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 26 treesize of output 20 [2018-04-11 17:41:07,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-11 17:41:07,264 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,290 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 30 treesize of output 23 [2018-04-11 17:41:07,290 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:07,315 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 26 treesize of output 22 [2018-04-11 17:41:07,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,341 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 23 treesize of output 16 [2018-04-11 17:41:07,341 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:41:07,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 28 treesize of output 22 [2018-04-11 17:41:07,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:07,383 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,387 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 17:41:07,387 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,389 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,413 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 28 treesize of output 22 [2018-04-11 17:41:07,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:07,414 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,418 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 17:41:07,418 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,420 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:07,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:07,440 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:94, output treesize:7 [2018-04-11 17:41:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:07,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:07,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 17:41:07,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:41:07,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:41:07,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:41:07,459 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 17 states. [2018-04-11 17:41:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:08,498 INFO L93 Difference]: Finished difference Result 307 states and 317 transitions. [2018-04-11 17:41:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:41:08,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-04-11 17:41:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:08,499 INFO L225 Difference]: With dead ends: 307 [2018-04-11 17:41:08,499 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 17:41:08,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 17:41:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 17:41:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 210. [2018-04-11 17:41:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 17:41:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-04-11 17:41:08,502 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 51 [2018-04-11 17:41:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:08,502 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-04-11 17:41:08,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:41:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-04-11 17:41:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:41:08,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:08,502 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:08,502 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash 562343791, now seen corresponding path program 1 times [2018-04-11 17:41:08,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:08,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:08,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:08,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:08,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:08,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:08,517 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:08,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:08,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:08,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:08,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:08,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:08,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:08,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:08,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:08,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:08,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 17:41:08,626 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 17:41:08,627 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 17:41:08,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:41:08,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:41:08,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,649 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 17:41:08,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-11 17:41:08,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:41:08,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:08,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2018-04-11 17:41:08,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-04-11 17:41:08,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:41:08,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:46 [2018-04-11 17:41:08,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-11 17:41:08,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,746 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 17:41:08,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-04-11 17:41:08,779 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 38 treesize of output 33 [2018-04-11 17:41:08,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-04-11 17:41:08,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:08,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:08,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:41:08,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:08,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:08,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-04-11 17:41:08,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-11 17:41:08,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:08,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-04-11 17:41:08,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:08,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:08,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:66 [2018-04-11 17:41:08,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-04-11 17:41:08,944 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 17:41:08,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:08,964 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 17:41:08,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-04-11 17:41:09,540 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 36 treesize of output 34 [2018-04-11 17:41:09,542 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 30 treesize of output 23 [2018-04-11 17:41:09,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:09,550 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:09,550 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 23 treesize of output 17 [2018-04-11 17:41:09,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:09,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:09,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:09,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-11 17:41:09,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:09,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:09,569 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 17:41:09,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:5 [2018-04-11 17:41:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:09,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:09,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 17:41:09,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 17:41:09,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 17:41:09,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=284, Unknown=2, NotChecked=0, Total=342 [2018-04-11 17:41:09,595 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 19 states. [2018-04-11 17:41:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:12,570 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2018-04-11 17:41:12,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 17:41:12,570 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-04-11 17:41:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:12,570 INFO L225 Difference]: With dead ends: 269 [2018-04-11 17:41:12,570 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 17:41:12,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=1203, Unknown=2, NotChecked=0, Total=1482 [2018-04-11 17:41:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 17:41:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-04-11 17:41:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 17:41:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 230 transitions. [2018-04-11 17:41:12,573 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 230 transitions. Word has length 51 [2018-04-11 17:41:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:12,573 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 230 transitions. [2018-04-11 17:41:12,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 17:41:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 230 transitions. [2018-04-11 17:41:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:41:12,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:12,574 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:12,574 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash 562343792, now seen corresponding path program 1 times [2018-04-11 17:41:12,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:12,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:12,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:12,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:12,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:12,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:12,586 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:12,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:12,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:12,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:12,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:12,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:12,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:12,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:12,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:12,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:41:12,672 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 17:41:12,675 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 17:41:12,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:41:12,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:12,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,711 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 17:41:12,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:51 [2018-04-11 17:41:12,741 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 69 treesize of output 73 [2018-04-11 17:41:12,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:12,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,766 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 29 treesize of output 30 [2018-04-11 17:41:12,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 14 treesize of output 13 [2018-04-11 17:41:12,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:12,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2018-04-11 17:41:12,879 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 17:41:12,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:12,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,897 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 17:41:12,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:95 [2018-04-11 17:41:12,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:41:12,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:12,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-04-11 17:41:12,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:12,974 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 17:41:12,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:121 [2018-04-11 17:41:13,025 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-04-11 17:41:13,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 92 [2018-04-11 17:41:13,092 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 17:41:13,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 63 [2018-04-11 17:41:13,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,231 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 2 case distinctions, treesize of input 45 treesize of output 60 [2018-04-11 17:41:13,231 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:13,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:13,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-04-11 17:41:13,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:13,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:13,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-11 17:41:13,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:13,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 17:41:13,384 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 112 [2018-04-11 17:41:13,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,410 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 90 treesize of output 101 [2018-04-11 17:41:13,410 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2018-04-11 17:41:13,450 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,466 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 100 [2018-04-11 17:41:13,473 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:13,474 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 29 treesize of output 24 [2018-04-11 17:41:13,475 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,486 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 68 [2018-04-11 17:41:13,492 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:13,493 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 34 treesize of output 54 [2018-04-11 17:41:13,493 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,503 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:13,559 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:146, output treesize:426 [2018-04-11 17:41:13,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 165 [2018-04-11 17:41:13,696 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 26 treesize of output 25 [2018-04-11 17:41:13,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,800 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 162 treesize of output 150 [2018-04-11 17:41:13,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:13,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 188 [2018-04-11 17:41:13,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-11 17:41:13,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:13,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:13,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:14,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 183 [2018-04-11 17:41:14,009 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 18 treesize of output 17 [2018-04-11 17:41:14,010 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,093 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 161 treesize of output 151 [2018-04-11 17:41:14,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:14,094 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,107 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 137 [2018-04-11 17:41:14,179 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 20 treesize of output 19 [2018-04-11 17:41:14,179 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,197 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:14,245 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:528, output treesize:444 [2018-04-11 17:41:14,326 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 177 treesize of output 189 [2018-04-11 17:41:14,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-04-11 17:41:14,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:14,417 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 175 treesize of output 188 [2018-04-11 17:41:14,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:14,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:14,595 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 146 treesize of output 176 [2018-04-11 17:41:14,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:14,605 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 150 treesize of output 165 [2018-04-11 17:41:14,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:14,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 148 [2018-04-11 17:41:14,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:14,855 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 159 treesize of output 179 [2018-04-11 17:41:14,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 163 [2018-04-11 17:41:14,858 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:14,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:14,918 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 157 treesize of output 170 [2018-04-11 17:41:14,918 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:14,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:15,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-2 vars, End of recursive call: 24 dim-0 vars, and 6 xjuncts. [2018-04-11 17:41:15,117 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 18 variables, input treesize:483, output treesize:926 [2018-04-11 17:41:15,449 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 257 [2018-04-11 17:41:15,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:15,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 196 [2018-04-11 17:41:15,541 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 188 treesize of output 177 [2018-04-11 17:41:15,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:15,654 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 173 treesize of output 166 [2018-04-11 17:41:15,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:15,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 180 treesize of output 173 [2018-04-11 17:41:15,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:15,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:15,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:15,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:15,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:15,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 189 [2018-04-11 17:41:15,862 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:15,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:15,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:15,965 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 173 treesize of output 167 [2018-04-11 17:41:15,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,061 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 166 treesize of output 159 [2018-04-11 17:41:16,062 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,161 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 1 case distinctions, treesize of input 180 treesize of output 178 [2018-04-11 17:41:16,162 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:16,279 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 170 treesize of output 159 [2018-04-11 17:41:16,280 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 158 [2018-04-11 17:41:16,281 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:41:16,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:16,573 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 155 treesize of output 155 [2018-04-11 17:41:16,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 17:41:16,575 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,590 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 17:41:16,590 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,601 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 138 [2018-04-11 17:41:16,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:16,798 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 21 treesize of output 17 [2018-04-11 17:41:16,798 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,808 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:16,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:16,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 182 [2018-04-11 17:41:16,999 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:16,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:17,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:17,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 163 [2018-04-11 17:41:17,000 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,086 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 166 treesize of output 155 [2018-04-11 17:41:17,086 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 148 [2018-04-11 17:41:17,164 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 141 [2018-04-11 17:41:17,240 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,313 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 162 treesize of output 151 [2018-04-11 17:41:17,313 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:17,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:17,386 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 158 treesize of output 152 [2018-04-11 17:41:17,386 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,459 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 1 case distinctions, treesize of input 151 treesize of output 149 [2018-04-11 17:41:17,460 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:17,543 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 148 treesize of output 141 [2018-04-11 17:41:17,543 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,594 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:41:17,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:17,825 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 173 treesize of output 173 [2018-04-11 17:41:17,827 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 17:41:17,828 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 17:41:17,850 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:17,864 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,117 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 2 case distinctions, treesize of input 157 treesize of output 159 [2018-04-11 17:41:18,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:18,119 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:18,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:18,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 146 [2018-04-11 17:41:18,121 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:18,162 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 155 treesize of output 151 [2018-04-11 17:41:18,162 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 131 [2018-04-11 17:41:18,200 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,233 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:18,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 6 dim-2 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-04-11 17:41:18,496 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 30 variables, input treesize:980, output treesize:1093 [2018-04-11 17:41:18,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:18,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:18,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 118 [2018-04-11 17:41:18,696 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 17:41:18,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,711 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:18,711 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 31 treesize of output 23 [2018-04-11 17:41:18,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2018-04-11 17:41:18,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:18,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:18,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:18,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:18,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 156 [2018-04-11 17:41:18,773 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 124 [2018-04-11 17:41:18,774 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:18,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 105 [2018-04-11 17:41:18,838 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,840 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 106 treesize of output 99 [2018-04-11 17:41:18,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,900 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 105 treesize of output 98 [2018-04-11 17:41:18,901 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,902 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 99 treesize of output 92 [2018-04-11 17:41:18,902 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:18,956 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 130 treesize of output 123 [2018-04-11 17:41:18,956 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:19,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 92 [2018-04-11 17:41:19,016 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:19,017 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:19,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2018-04-11 17:41:19,018 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 96 [2018-04-11 17:41:19,079 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 17:41:19,128 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:19,129 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 96 treesize of output 86 [2018-04-11 17:41:19,129 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,176 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:19,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-04-11 17:41:19,242 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 17:41:19,242 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-11 17:41:19,253 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,265 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 32 treesize of output 13 [2018-04-11 17:41:19,265 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,273 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-04-11 17:41:19,277 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 17:41:19,277 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,287 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 17:41:19,287 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:41:19,297 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,304 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-04-11 17:41:19,308 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 29 [2018-04-11 17:41:19,309 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 17:41:19,321 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,330 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 17:41:19,330 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,338 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-11 17:41:19,387 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 17:41:19,387 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:41:19,394 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,399 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:19,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:19,433 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 12 variables, input treesize:303, output treesize:73 [2018-04-11 17:41:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:19,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:19,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 17:41:19,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 17:41:19,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 17:41:19,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-04-11 17:41:19,558 INFO L87 Difference]: Start difference. First operand 218 states and 230 transitions. Second operand 23 states. [2018-04-11 17:41:20,831 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 187 DAG size of output 184 [2018-04-11 17:41:21,034 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 184 DAG size of output 181 [2018-04-11 17:41:21,546 WARN L151 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 266 DAG size of output 266 [2018-04-11 17:41:21,974 WARN L151 SmtUtils]: Spent 333ms on a formula simplification. DAG size of input: 436 DAG size of output 270 [2018-04-11 17:41:23,043 WARN L151 SmtUtils]: Spent 891ms on a formula simplification. DAG size of input: 490 DAG size of output 315 [2018-04-11 17:41:23,611 WARN L151 SmtUtils]: Spent 428ms on a formula simplification. DAG size of input: 480 DAG size of output 312 [2018-04-11 17:41:24,196 WARN L151 SmtUtils]: Spent 437ms on a formula simplification. DAG size of input: 492 DAG size of output 317 [2018-04-11 17:41:24,474 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 278 DAG size of output 271 [2018-04-11 17:41:25,848 WARN L151 SmtUtils]: Spent 704ms on a formula simplification. DAG size of input: 426 DAG size of output 426 [2018-04-11 17:41:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:26,067 INFO L93 Difference]: Finished difference Result 318 states and 329 transitions. [2018-04-11 17:41:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 17:41:26,067 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-04-11 17:41:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:26,068 INFO L225 Difference]: With dead ends: 318 [2018-04-11 17:41:26,068 INFO L226 Difference]: Without dead ends: 318 [2018-04-11 17:41:26,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=305, Invalid=1760, Unknown=5, NotChecked=0, Total=2070 [2018-04-11 17:41:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-11 17:41:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 224. [2018-04-11 17:41:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 17:41:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 236 transitions. [2018-04-11 17:41:26,072 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 236 transitions. Word has length 51 [2018-04-11 17:41:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:26,072 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 236 transitions. [2018-04-11 17:41:26,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 17:41:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 236 transitions. [2018-04-11 17:41:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 17:41:26,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:26,073 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:41:26,073 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1765591609, now seen corresponding path program 1 times [2018-04-11 17:41:26,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:26,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:26,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:26,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:26,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:26,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:26,087 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:26,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:26,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:26,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:26,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:26,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:41:26,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-04-11 17:41:26,133 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 17:41:26,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:26,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 17:41:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 17:41:26,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:26,153 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 17:41:26,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,162 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 17:41:26,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 17:41:26,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:26,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:26,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:26,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:41:26,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:26,241 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 17:41:26,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:54 [2018-04-11 17:41:26,261 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 28 treesize of output 24 [2018-04-11 17:41:26,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:26,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 40 [2018-04-11 17:41:26,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 17:41:26,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:41:26,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:26,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:185 [2018-04-11 17:41:27,430 WARN L148 SmtUtils]: Spent 1036ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-11 17:41:27,436 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 77 treesize of output 73 [2018-04-11 17:41:27,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, 1 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 17:41:27,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,491 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 84 treesize of output 80 [2018-04-11 17:41:27,492 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 14 treesize of output 13 [2018-04-11 17:41:27,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,540 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 77 treesize of output 73 [2018-04-11 17:41:27,541 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 14 treesize of output 13 [2018-04-11 17:41:27,542 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,551 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:27,585 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:239, output treesize:215 [2018-04-11 17:41:27,730 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 76 treesize of output 58 [2018-04-11 17:41:27,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,767 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 83 treesize of output 65 [2018-04-11 17:41:27,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,799 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 76 treesize of output 58 [2018-04-11 17:41:27,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:27,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:236, output treesize:182 [2018-04-11 17:41:27,908 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 68 treesize of output 59 [2018-04-11 17:41:27,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:27,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:27,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 17:41:27,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:27,921 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 17:41:27,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,927 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 17:41:27,958 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 68 treesize of output 59 [2018-04-11 17:41:27,959 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:27,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:27,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-11 17:41:27,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,969 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 17:41:27,969 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:27,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:28,001 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 75 treesize of output 64 [2018-04-11 17:41:28,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:28,004 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:28,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2018-04-11 17:41:28,011 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:28,030 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 17:41:28,030 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:28,042 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:28,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:28,079 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:212, output treesize:106 [2018-04-11 17:41:28,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:28,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2018-04-11 17:41:28,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:28,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:28,155 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 31 treesize of output 31 [2018-04-11 17:41:28,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:28,172 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 17:41:28,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:65 [2018-04-11 17:41:28,249 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 17:41:28,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:28,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 17:41:28,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:41:28,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:41:28,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=227, Unknown=6, NotChecked=0, Total=272 [2018-04-11 17:41:28,250 INFO L87 Difference]: Start difference. First operand 224 states and 236 transitions. Second operand 17 states. [2018-04-11 17:41:28,866 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 100 DAG size of output 98 [2018-04-11 17:41:29,612 WARN L151 SmtUtils]: Spent 691ms on a formula simplification. DAG size of input: 184 DAG size of output 125 [2018-04-11 17:41:29,798 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 166 DAG size of output 107 [2018-04-11 17:41:30,031 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 171 DAG size of output 153 [2018-04-11 17:41:30,425 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 188 DAG size of output 162 [2018-04-11 17:41:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:30,675 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-04-11 17:41:30,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:41:30,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-04-11 17:41:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:30,676 INFO L225 Difference]: With dead ends: 238 [2018-04-11 17:41:30,676 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 17:41:30,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=163, Invalid=761, Unknown=6, NotChecked=0, Total=930 [2018-04-11 17:41:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 17:41:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 229. [2018-04-11 17:41:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 17:41:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 241 transitions. [2018-04-11 17:41:30,678 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 241 transitions. Word has length 54 [2018-04-11 17:41:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:30,678 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 241 transitions. [2018-04-11 17:41:30,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:41:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 241 transitions. [2018-04-11 17:41:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 17:41:30,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:30,679 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:41:30,679 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1725125489, now seen corresponding path program 1 times [2018-04-11 17:41:30,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:30,679 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:30,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:30,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:30,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:30,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:30,689 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:30,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:30,690 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:30,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:30,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:30,774 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 17:41:30,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 8 treesize of output 7 [2018-04-11 17:41:30,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,789 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 17:41:30,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:30,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,801 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 17:41:30,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-04-11 17:41:30,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:30,846 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 51 [2018-04-11 17:41:30,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:30,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,860 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 17:41:30,861 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 3 [2018-04-11 17:41:30,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:30,868 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 17:41:30,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:47 [2018-04-11 17:41:31,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:31,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 17:41:31,151 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 33 treesize of output 30 [2018-04-11 17:41:31,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:31,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:41:31,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:31,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:31,177 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 2 xjuncts. [2018-04-11 17:41:31,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:58, output treesize:65 [2018-04-11 17:41:31,307 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 17:41:31,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:31,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 17:41:31,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:41:31,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:41:31,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=243, Unknown=24, NotChecked=0, Total=306 [2018-04-11 17:41:31,308 INFO L87 Difference]: Start difference. First operand 229 states and 241 transitions. Second operand 18 states. [2018-04-11 17:41:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:32,093 INFO L93 Difference]: Finished difference Result 232 states and 243 transitions. [2018-04-11 17:41:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:41:32,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-04-11 17:41:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:32,094 INFO L225 Difference]: With dead ends: 232 [2018-04-11 17:41:32,094 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 17:41:32,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=608, Unknown=38, NotChecked=0, Total=756 [2018-04-11 17:41:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 17:41:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-11 17:41:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 17:41:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2018-04-11 17:41:32,096 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 57 [2018-04-11 17:41:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:32,096 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2018-04-11 17:41:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:41:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2018-04-11 17:41:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 17:41:32,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:32,096 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:32,097 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1823346732, now seen corresponding path program 1 times [2018-04-11 17:41:32,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:32,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:32,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:32,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:32,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:32,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:32,106 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:32,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:32,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:32,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:32,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:32,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:32,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:32,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 17:41:32,178 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 17:41:32,195 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 17:41:32,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,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 17:41:32,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 17:41:32,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,234 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 17:41:32,234 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-04-11 17:41:32,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-11 17:41:32,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:32,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,313 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 29 treesize of output 30 [2018-04-11 17:41:32,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:32,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,345 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 17:41:32,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2018-04-11 17:41:32,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-04-11 17:41:32,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:32,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:96 [2018-04-11 17:41:32,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 74 [2018-04-11 17:41:32,465 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 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-11 17:41:32,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:32,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:32,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-04-11 17:41:32,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-11 17:41:32,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 89 [2018-04-11 17:41:32,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 17:41:32,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,583 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:32,620 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:126, output treesize:181 [2018-04-11 17:41:32,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 104 [2018-04-11 17:41:32,696 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 22 treesize of output 21 [2018-04-11 17:41:32,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-11 17:41:32,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 17:41:32,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,745 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 17:41:32,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:120 [2018-04-11 17:41:32,805 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 39 treesize of output 35 [2018-04-11 17:41:32,806 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 17:41:32,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,814 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:32,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 17:41:32,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:32,835 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:137, output treesize:105 [2018-04-11 17:41:32,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:32,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:32,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2018-04-11 17:41:32,890 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:32,894 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 49 [2018-04-11 17:41:32,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:32,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:32,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-04-11 17:41:32,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:32,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-11 17:41:32,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:32,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:32,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:32,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:112, output treesize:28 [2018-04-11 17:41:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:32,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:32,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:41:32,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:41:32,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:41:32,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=318, Unknown=1, NotChecked=0, Total=380 [2018-04-11 17:41:32,987 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 20 states. [2018-04-11 17:41:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:34,309 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2018-04-11 17:41:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 17:41:34,309 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-04-11 17:41:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:34,310 INFO L225 Difference]: With dead ends: 257 [2018-04-11 17:41:34,310 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 17:41:34,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=1426, Unknown=4, NotChecked=0, Total=1722 [2018-04-11 17:41:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 17:41:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 192. [2018-04-11 17:41:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 17:41:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2018-04-11 17:41:34,314 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 60 [2018-04-11 17:41:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:34,314 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2018-04-11 17:41:34,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:41:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2018-04-11 17:41:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 17:41:34,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:34,315 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:34,315 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1823346733, now seen corresponding path program 1 times [2018-04-11 17:41:34,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:34,315 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:34,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:34,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:34,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:34,349 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:34,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:34,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:34,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:34,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:34,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:34,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:34,442 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 17:41:34,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:41:34,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 17:41:34,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,467 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 17:41:34,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-11 17:41:34,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 17:41:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,490 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 17:41:34,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,506 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 17:41:34,508 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 17:41:34,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,519 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 17:41:34,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:37 [2018-04-11 17:41:34,550 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 38 treesize of output 39 [2018-04-11 17:41:34,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:34,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,571 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 43 treesize of output 47 [2018-04-11 17:41:34,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:34,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,587 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 17:41:34,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-11 17:41:34,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 6 treesize of output 5 [2018-04-11 17:41:34,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 32 [2018-04-11 17:41:34,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,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 1 xjuncts. [2018-04-11 17:41:34,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:100 [2018-04-11 17:41:34,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 17:41:34,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,764 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 48 treesize of output 58 [2018-04-11 17:41:34,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:34,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-11 17:41:34,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2018-04-11 17:41:34,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-11 17:41:34,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:34,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:34,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:34,854 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:127, output treesize:165 [2018-04-11 17:41:34,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:34,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 124 [2018-04-11 17:41:34,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 113 treesize of output 112 [2018-04-11 17:41:34,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:34,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:35,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:35,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 101 [2018-04-11 17:41:35,014 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 99 treesize of output 98 [2018-04-11 17:41:35,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,066 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 17:41:35,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:113 [2018-04-11 17:41:35,124 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 37 treesize of output 26 [2018-04-11 17:41:35,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:35,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,143 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 17:41:35,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:167, output treesize:155 [2018-04-11 17:41:35,214 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 35 treesize of output 39 [2018-04-11 17:41:35,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-11 17:41:35,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,223 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 28 treesize of output 12 [2018-04-11 17:41:35,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,229 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:35,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 17:41:35,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:35,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:35,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:162, output treesize:272 [2018-04-11 17:41:35,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:35,423 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:35,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:35,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:35,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 112 [2018-04-11 17:41:35,428 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 1 [2018-04-11 17:41:35,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:35,440 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 50 treesize of output 43 [2018-04-11 17:41:35,441 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 17:41:35,451 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:35,451 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 40 treesize of output 30 [2018-04-11 17:41:35,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:35,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-11 17:41:35,478 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 17:41:35,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:35,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:41:35,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:35,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:35,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-11 17:41:35,495 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:35,507 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:169, output treesize:9 [2018-04-11 17:41:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:35,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:35,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 17:41:35,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 17:41:35,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 17:41:35,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=588, Unknown=2, NotChecked=0, Total=650 [2018-04-11 17:41:35,576 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 26 states. [2018-04-11 17:41:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:37,867 INFO L93 Difference]: Finished difference Result 289 states and 299 transitions. [2018-04-11 17:41:37,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 17:41:37,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-11 17:41:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:37,868 INFO L225 Difference]: With dead ends: 289 [2018-04-11 17:41:37,868 INFO L226 Difference]: Without dead ends: 289 [2018-04-11 17:41:37,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=372, Invalid=2380, Unknown=4, NotChecked=0, Total=2756 [2018-04-11 17:41:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-11 17:41:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2018-04-11 17:41:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 17:41:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 203 transitions. [2018-04-11 17:41:37,872 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 203 transitions. Word has length 60 [2018-04-11 17:41:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:37,872 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 203 transitions. [2018-04-11 17:41:37,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 17:41:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 203 transitions. [2018-04-11 17:41:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 17:41:37,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:37,873 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:37,873 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash -594351121, now seen corresponding path program 2 times [2018-04-11 17:41:37,873 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:37,873 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:37,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:37,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:37,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:37,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:37,886 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:37,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:37,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:37,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:41:37,921 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:41:37,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:41:37,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:37,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:37,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:37,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:41:37,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:37,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:37,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 17:41:37,974 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 17:41:37,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:37,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:37,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:37,987 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 17:41:37,988 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 17:41:37,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:37,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,005 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 17:41:38,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-11 17:41:38,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 17:41:38,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:38,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,053 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 43 treesize of output 47 [2018-04-11 17:41:38,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:38,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,066 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 17:41:38,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2018-04-11 17:41:38,125 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 14 [2018-04-11 17:41:38,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 14 treesize of output 13 [2018-04-11 17:41:38,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,144 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 17:41:38,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:88 [2018-04-11 17:41:38,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-04-11 17:41:38,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:38,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:102, output treesize:108 [2018-04-11 17:41:38,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-04-11 17:41:38,222 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 2 case distinctions, treesize of input 25 treesize of output 39 [2018-04-11 17:41:38,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:38,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:38,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 96 [2018-04-11 17:41:38,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,277 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:38,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 54 [2018-04-11 17:41:38,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,299 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:38,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 83 [2018-04-11 17:41:38,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:38,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 17:41:38,303 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,340 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 2 xjuncts. [2018-04-11 17:41:38,340 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:135, output treesize:271 [2018-04-11 17:41:38,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 139 [2018-04-11 17:41:38,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 17:41:38,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 109 [2018-04-11 17:41:38,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:38,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:38,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:132 [2018-04-11 17:41:38,564 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 55 treesize of output 60 [2018-04-11 17:41:38,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21 [2018-04-11 17:41:38,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,586 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 17:41:38,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:203, output treesize:187 [2018-04-11 17:41:38,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-04-11 17:41:38,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:38,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:187, output treesize:156 [2018-04-11 17:41:38,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:38,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 123 [2018-04-11 17:41:38,700 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 17:41:38,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2018-04-11 17:41:38,710 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 17:41:38,719 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:38,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-11 17:41:38,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:38,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-04-11 17:41:38,741 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 7 [2018-04-11 17:41:38,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:38,749 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 31 treesize of output 31 [2018-04-11 17:41:38,750 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,754 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 28 treesize of output 11 [2018-04-11 17:41:38,754 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:38,764 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:167, output treesize:24 [2018-04-11 17:41:38,805 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 17:41:38,808 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 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:41:38,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:38,813 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 17:41:38,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:38,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:38,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:38,818 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-04-11 17:41:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:38,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:38,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 17:41:38,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 17:41:38,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 17:41:38,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=508, Unknown=5, NotChecked=0, Total=600 [2018-04-11 17:41:38,870 INFO L87 Difference]: Start difference. First operand 192 states and 203 transitions. Second operand 25 states. [2018-04-11 17:41:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:40,280 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2018-04-11 17:41:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 17:41:40,280 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-04-11 17:41:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:40,281 INFO L225 Difference]: With dead ends: 231 [2018-04-11 17:41:40,281 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 17:41:40,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=2067, Unknown=13, NotChecked=0, Total=2450 [2018-04-11 17:41:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 17:41:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2018-04-11 17:41:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 17:41:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 202 transitions. [2018-04-11 17:41:40,284 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 202 transitions. Word has length 60 [2018-04-11 17:41:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:40,284 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 202 transitions. [2018-04-11 17:41:40,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 17:41:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 202 transitions. [2018-04-11 17:41:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 17:41:40,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:40,284 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:40,284 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1875985662, now seen corresponding path program 2 times [2018-04-11 17:41:40,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:40,285 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:40,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:40,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:41:40,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:40,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:40,296 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:40,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:40,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:41:40,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:41:40,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:41:40,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:40,352 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 17:41:40,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:40,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 17:41:40,366 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 17:41:40,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,385 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 35 [2018-04-11 17:41:40,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:40,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:40,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:22 [2018-04-11 17:41:40,464 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 32 treesize of output 59 [2018-04-11 17:41:40,469 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 34 treesize of output 35 [2018-04-11 17:41:40,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,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 29 treesize of output 28 [2018-04-11 17:41:40,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,564 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 17:41:40,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-04-11 17:41:40,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:40,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 3 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 74 [2018-04-11 17:41:40,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 43 [2018-04-11 17:41:40,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:40,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:40,738 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 40 treesize of output 32 [2018-04-11 17:41:40,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:40,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:40,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 43 [2018-04-11 17:41:40,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:40,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:40,867 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 4 case distinctions, treesize of input 38 treesize of output 50 [2018-04-11 17:41:40,868 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-11 17:41:40,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-11 17:41:40,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:40,951 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:139 [2018-04-11 17:41:40,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:40,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:40,992 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 38 treesize of output 42 [2018-04-11 17:41:40,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,012 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 41 treesize of output 45 [2018-04-11 17:41:41,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:41,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:76 [2018-04-11 17:41:41,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-04-11 17:41:41,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, 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 17:41:41,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,103 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 55 treesize of output 52 [2018-04-11 17:41:41,104 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 17:41:41,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,143 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 51 treesize of output 48 [2018-04-11 17:41:41,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:41,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,181 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 57 treesize of output 54 [2018-04-11 17:41:41,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:41,183 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,193 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:41,221 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:120, output treesize:103 [2018-04-11 17:41:41,294 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 96 treesize of output 92 [2018-04-11 17:41:41,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:41,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,349 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 88 treesize of output 81 [2018-04-11 17:41:41,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:41,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,393 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 90 treesize of output 86 [2018-04-11 17:41:41,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:41,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,433 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 82 treesize of output 75 [2018-04-11 17:41:41,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:41,434 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,452 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:41,481 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:187, output treesize:155 [2018-04-11 17:41:41,538 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 94 treesize of output 84 [2018-04-11 17:41:41,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:41,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:41:41,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,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 72 [2018-04-11 17:41:41,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 17:41:41,594 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-04-11 17:41:41,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:41,633 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:177, output treesize:129 [2018-04-11 17:41:41,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 102 [2018-04-11 17:41:41,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2018-04-11 17:41:41,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:41:41,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,713 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 77 treesize of output 76 [2018-04-11 17:41:41,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:41,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,785 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 67 treesize of output 69 [2018-04-11 17:41:41,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-04-11 17:41:41,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 17:41:41,826 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:147, output treesize:196 [2018-04-11 17:41:41,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:41,930 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 60 treesize of output 62 [2018-04-11 17:41:41,934 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-04-11 17:41:41,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,943 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 17:41:41,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,984 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 80 treesize of output 74 [2018-04-11 17:41:41,985 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 17:41:41,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:41,996 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 17:41:41,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:42,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:42,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 88 [2018-04-11 17:41:42,041 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 84 treesize of output 77 [2018-04-11 17:41:42,041 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:42,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:42,074 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 76 treesize of output 70 [2018-04-11 17:41:42,074 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-04-11 17:41:42,103 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-04-11 17:41:42,133 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-04-11 17:41:42,161 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,184 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:42,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:42,223 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:221, output treesize:213 [2018-04-11 17:41:42,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-11 17:41:42,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 17:41:42,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,328 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 17:41:42,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:42,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:42,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2018-04-11 17:41:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:42,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:41:42,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-11 17:41:42,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:41:42,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:41:42,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:41:42,395 INFO L87 Difference]: Start difference. First operand 192 states and 202 transitions. Second operand 20 states. [2018-04-11 17:41:43,090 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 93 DAG size of output 80 [2018-04-11 17:41:43,296 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 127 DAG size of output 120 [2018-04-11 17:41:43,917 WARN L151 SmtUtils]: Spent 585ms on a formula simplification. DAG size of input: 173 DAG size of output 161 [2018-04-11 17:41:44,062 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 134 DAG size of output 120 [2018-04-11 17:41:44,296 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 127 DAG size of output 122 [2018-04-11 17:41:44,479 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 134 DAG size of output 125 [2018-04-11 17:41:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:44,743 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-04-11 17:41:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:41:44,743 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-04-11 17:41:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:44,744 INFO L225 Difference]: With dead ends: 198 [2018-04-11 17:41:44,744 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 17:41:44,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:41:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 17:41:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2018-04-11 17:41:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 17:41:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2018-04-11 17:41:44,747 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 65 [2018-04-11 17:41:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:44,748 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2018-04-11 17:41:44,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:41:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2018-04-11 17:41:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 17:41:44,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:44,748 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:44,749 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1875985661, now seen corresponding path program 1 times [2018-04-11 17:41:44,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:44,749 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:44,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:44,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:41:44,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:44,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:44,773 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:44,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:44,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:44,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:44,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:44,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:44,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:44,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:41:44,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:41:44,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 17:41:44,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:44,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:44,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:44,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-11 17:41:44,902 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 17:41:44,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:41:44,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,914 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 17:41:44,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2018-04-11 17:41:44,955 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 39 treesize of output 43 [2018-04-11 17:41:44,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:44,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:44,968 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 17:41:44,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 17:41:45,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-04-11 17:41:45,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:45,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,026 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 17:41:45,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:68 [2018-04-11 17:41:45,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 17:41:45,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:45,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:66 [2018-04-11 17:41:45,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-04-11 17:41:45,081 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:41:45,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:45,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:45,114 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 2 xjuncts. [2018-04-11 17:41:45,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:132 [2018-04-11 17:41:45,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2018-04-11 17:41:45,172 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 14 treesize of output 13 [2018-04-11 17:41:45,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,187 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 17:41:45,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:70 [2018-04-11 17:41:45,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 51 [2018-04-11 17:41:45,214 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 35 treesize of output 32 [2018-04-11 17:41:45,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,219 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 22 treesize of output 13 [2018-04-11 17:41:45,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-04-11 17:41:45,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:45,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:45,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:45,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:34 [2018-04-11 17:41:45,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-04-11 17:41:45,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:45,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,290 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 17:41:45,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-04-11 17:41:45,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 56 [2018-04-11 17:41:45,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-04-11 17:41:45,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:45,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:43 [2018-04-11 17:41:45,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 41 treesize of output 95 [2018-04-11 17:41:45,380 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 17:41:45,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,397 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 59 treesize of output 68 [2018-04-11 17:41:45,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:45,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-11 17:41:45,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:45,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,716 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 39 treesize of output 48 [2018-04-11 17:41:45,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:45,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:45,805 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 39 treesize of output 48 [2018-04-11 17:41:45,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:45,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 17:41:45,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 4 xjuncts. [2018-04-11 17:41:45,908 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:56, output treesize:182 [2018-04-11 17:41:46,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-04-11 17:41:46,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-04-11 17:41:46,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,154 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 56 treesize of output 49 [2018-04-11 17:41:46,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,263 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 52 treesize of output 46 [2018-04-11 17:41:46,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,345 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 52 treesize of output 45 [2018-04-11 17:41:46,346 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,424 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 48 treesize of output 41 [2018-04-11 17:41:46,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,504 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 49 treesize of output 42 [2018-04-11 17:41:46,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,581 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 41 treesize of output 34 [2018-04-11 17:41:46,581 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,659 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 42 treesize of output 35 [2018-04-11 17:41:46,659 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:46,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 60 [2018-04-11 17:41:46,746 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,827 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 35 treesize of output 28 [2018-04-11 17:41:46,828 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,900 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 45 treesize of output 38 [2018-04-11 17:41:46,900 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:46,974 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 46 treesize of output 39 [2018-04-11 17:41:46,974 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,045 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 48 treesize of output 41 [2018-04-11 17:41:47,045 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,120 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 41 treesize of output 48 [2018-04-11 17:41:47,120 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,182 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 52 treesize of output 45 [2018-04-11 17:41:47,183 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,240 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 45 treesize of output 41 [2018-04-11 17:41:47,241 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,297 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 32 [2018-04-11 17:41:47,297 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:47,357 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 41 treesize of output 44 [2018-04-11 17:41:47,357 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-11 17:41:47,408 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,450 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 39 treesize of output 32 [2018-04-11 17:41:47,450 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 20 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 17:41:47,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 17:41:47,533 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 17:41:47,533 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:41:47,539 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:47,544 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,546 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-04-11 17:41:47,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:47,594 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,601 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 17:41:47,601 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,605 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 17:41:47,605 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,608 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 17:41:47,655 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 17:41:47,655 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,661 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 17:41:47,661 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:41:47,666 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,670 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:47,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:47,710 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 26 variables, input treesize:190, output treesize:7 [2018-04-11 17:41:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:47,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:47,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 17:41:47,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:41:47,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:41:47,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:41:47,752 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand 24 states. [2018-04-11 17:41:48,968 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 152 DAG size of output 152 [2018-04-11 17:41:49,224 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 156 DAG size of output 156 [2018-04-11 17:41:49,778 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 150 DAG size of output 150 [2018-04-11 17:41:50,144 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 144 DAG size of output 144 [2018-04-11 17:41:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:50,216 INFO L93 Difference]: Finished difference Result 318 states and 327 transitions. [2018-04-11 17:41:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 17:41:50,216 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-04-11 17:41:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:50,217 INFO L225 Difference]: With dead ends: 318 [2018-04-11 17:41:50,217 INFO L226 Difference]: Without dead ends: 318 [2018-04-11 17:41:50,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=330, Invalid=2120, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 17:41:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-11 17:41:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 221. [2018-04-11 17:41:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 17:41:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 231 transitions. [2018-04-11 17:41:50,220 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 231 transitions. Word has length 65 [2018-04-11 17:41:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:50,221 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 231 transitions. [2018-04-11 17:41:50,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:41:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 231 transitions. [2018-04-11 17:41:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 17:41:50,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:50,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:50,222 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1283781, now seen corresponding path program 3 times [2018-04-11 17:41:50,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:50,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:50,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:50,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:50,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:50,237 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:50,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:50,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:50,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:41:50,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 17:41:50,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:41:50,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:50,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:50,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:50,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:41:50,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:41:50,369 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 17:41:50,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:41:50,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,382 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 17:41:50,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:41:50,411 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 39 treesize of output 43 [2018-04-11 17:41:50,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:50,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,421 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 17:41:50,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 17:41:50,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 17:41:50,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,478 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 6 treesize of output 5 [2018-04-11 17:41:50,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,486 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 17:41:50,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:68 [2018-04-11 17:41:50,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-04-11 17:41:50,513 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:41:50,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:50,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:50,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:50,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:144 [2018-04-11 17:41:50,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 84 [2018-04-11 17:41:50,606 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 14 treesize of output 13 [2018-04-11 17:41:50,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:50,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:76 [2018-04-11 17:41:50,716 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 21 treesize of output 15 [2018-04-11 17:41:50,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:50,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:119, output treesize:102 [2018-04-11 17:41:50,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,764 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 102 [2018-04-11 17:41:50,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:50,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:113, output treesize:131 [2018-04-11 17:41:50,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 105 [2018-04-11 17:41:50,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2018-04-11 17:41:50,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:50,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:50,873 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 2 xjuncts. [2018-04-11 17:41:50,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:145, output treesize:248 [2018-04-11 17:41:50,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:50,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 131 [2018-04-11 17:41:50,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-11 17:41:50,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:50,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:51,007 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 17:41:51,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:183, output treesize:167 [2018-04-11 17:41:51,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:51,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:51,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 92 [2018-04-11 17:41:51,100 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-04-11 17:41:51,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:51,121 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 17:41:51,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:51,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2018-04-11 17:41:51,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:51,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-04-11 17:41:51,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:51,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-11 17:41:51,176 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:51,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-11 17:41:51,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:51,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:51,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:51,221 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:171, output treesize:91 [2018-04-11 17:41:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:51,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:51,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 17:41:51,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 17:41:51,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 17:41:51,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=520, Unknown=1, NotChecked=0, Total=600 [2018-04-11 17:41:51,343 INFO L87 Difference]: Start difference. First operand 221 states and 231 transitions. Second operand 25 states. [2018-04-11 17:41:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:53,854 INFO L93 Difference]: Finished difference Result 288 states and 298 transitions. [2018-04-11 17:41:53,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 17:41:53,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-04-11 17:41:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:53,855 INFO L225 Difference]: With dead ends: 288 [2018-04-11 17:41:53,855 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 17:41:53,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=351, Invalid=2396, Unknown=9, NotChecked=0, Total=2756 [2018-04-11 17:41:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 17:41:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 229. [2018-04-11 17:41:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 17:41:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 240 transitions. [2018-04-11 17:41:53,858 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 240 transitions. Word has length 65 [2018-04-11 17:41:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:53,858 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 240 transitions. [2018-04-11 17:41:53,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 17:41:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 240 transitions. [2018-04-11 17:41:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 17:41:53,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:53,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:53,858 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1283782, now seen corresponding path program 2 times [2018-04-11 17:41:53,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:53,859 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:53,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:53,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:41:53,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:53,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:53,871 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:53,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:53,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:53,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:41:53,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:41:53,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:41:53,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:53,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:53,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:53,974 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 17:41:53,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:53,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:53,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 17:41:54,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 17:41:54,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, 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 17:41:54,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,015 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 17:41:54,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2018-04-11 17:41:54,048 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 48 treesize of output 52 [2018-04-11 17:41:54,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:54,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,064 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 17:41:54,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-11 17:41:54,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,156 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 23 treesize of output 37 [2018-04-11 17:41:54,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 17:41:54,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,191 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 17:41:54,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:95 [2018-04-11 17:41:54,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-04-11 17:41:54,241 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 2 case distinctions, treesize of input 25 treesize of output 39 [2018-04-11 17:41:54,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:54,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:54,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,296 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 74 treesize of output 91 [2018-04-11 17:41:54,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-11 17:41:54,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,313 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 74 treesize of output 79 [2018-04-11 17:41:54,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-11 17:41:54,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:54,352 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:125, output treesize:250 [2018-04-11 17:41:54,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,431 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 83 treesize of output 84 [2018-04-11 17:41:54,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:54,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 128 [2018-04-11 17:41:54,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, 1 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 17:41:54,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,495 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 17:41:54,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:119 [2018-04-11 17:41:54,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,623 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 48 treesize of output 91 [2018-04-11 17:41:54,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,646 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 37 treesize of output 73 [2018-04-11 17:41:54,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,663 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 17:41:54,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:186 [2018-04-11 17:41:54,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 155 [2018-04-11 17:41:54,707 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 20 treesize of output 27 [2018-04-11 17:41:54,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:54,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:54,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 170 [2018-04-11 17:41:54,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 17:41:54,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:54,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:54,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:54,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 168 [2018-04-11 17:41:54,820 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 26 treesize of output 21 [2018-04-11 17:41:54,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:54,883 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:208, output treesize:331 [2018-04-11 17:41:54,975 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 275 treesize of output 259 [2018-04-11 17:41:54,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 17:41:54,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:54,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:55,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:55,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 183 [2018-04-11 17:41:55,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-11 17:41:55,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:55,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:287, output treesize:247 [2018-04-11 17:41:55,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:55,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:55,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 140 [2018-04-11 17:41:55,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-04-11 17:41:55,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:55,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 17:41:55,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2018-04-11 17:41:55,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:55,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-04-11 17:41:55,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:55,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 31 [2018-04-11 17:41:55,216 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 17:41:55,216 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,220 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 20 treesize of output 11 [2018-04-11 17:41:55,220 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,222 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:55,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:55,230 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:258, output treesize:38 [2018-04-11 17:41:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:41:55,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:41:55,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 17:41:55,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 17:41:55,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 17:41:55,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:41:55,305 INFO L87 Difference]: Start difference. First operand 229 states and 240 transitions. Second operand 26 states. [2018-04-11 17:41:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:41:57,298 INFO L93 Difference]: Finished difference Result 329 states and 339 transitions. [2018-04-11 17:41:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 17:41:57,298 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-04-11 17:41:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:41:57,299 INFO L225 Difference]: With dead ends: 329 [2018-04-11 17:41:57,299 INFO L226 Difference]: Without dead ends: 329 [2018-04-11 17:41:57,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=2565, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 17:41:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-11 17:41:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 235. [2018-04-11 17:41:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-11 17:41:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 246 transitions. [2018-04-11 17:41:57,302 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 246 transitions. Word has length 65 [2018-04-11 17:41:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:41:57,303 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 246 transitions. [2018-04-11 17:41:57,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 17:41:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 246 transitions. [2018-04-11 17:41:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 17:41:57,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:41:57,304 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:41:57,304 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:41:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash 973379520, now seen corresponding path program 1 times [2018-04-11 17:41:57,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:41:57,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:41:57,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:57,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:41:57,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:41:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:57,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:41:57,319 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:41:57,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:41:57,319 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:41:57,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:41:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:41:57,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:41:57,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:57,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:41:57,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:57,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:41:57,402 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 17:41:57,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 17:41:57,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:41:57,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:41:57,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,430 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 17:41:57,431 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 17:41:57,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,439 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 17:41:57,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 17:41:57,467 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 29 treesize of output 30 [2018-04-11 17:41:57,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:41:57,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,485 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 43 treesize of output 47 [2018-04-11 17:41:57,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17:41:57,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,500 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 17:41:57,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-04-11 17:41:57,519 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 42 treesize of output 30 [2018-04-11 17:41:57,520 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 17:41:57,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,525 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 17:41:57,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:41:57,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:58, output treesize:39 [2018-04-11 17:41:57,575 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 43 treesize of output 38 [2018-04-11 17:41:57,581 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 34 treesize of output 36 [2018-04-11 17:41:57,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:57,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:57,605 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 2 xjuncts. [2018-04-11 17:41:57,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:75 [2018-04-11 17:41:57,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 64 [2018-04-11 17:41:57,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-11 17:41:57,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:41:57,742 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 31 treesize of output 39 [2018-04-11 17:41:57,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:41:57,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:41:57,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 17:41:57,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:83 [2018-04-11 17:42:21,391 WARN L148 SmtUtils]: Spent 19349ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 17:42:39,958 WARN L148 SmtUtils]: Spent 14517ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 17:42:39,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 61 [2018-04-11 17:42:39,978 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:42:39,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-04-11 17:42:39,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-11 17:42:40,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,062 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:42:40,063 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 49 treesize of output 45 [2018-04-11 17:42:40,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:42:40,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:42:40,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:42:40,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 52 [2018-04-11 17:42:40,131 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:42:40,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,186 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 45 treesize of output 39 [2018-04-11 17:42:40,187 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:42:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:42:40,187 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,194 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 17:42:40,195 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,199 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:42:40,212 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:103, output treesize:3 [2018-04-11 17:42:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:42:40,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:42:40,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:42:40,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:42:40,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:42:40,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=234, Unknown=3, NotChecked=0, Total=272 [2018-04-11 17:42:40,254 INFO L87 Difference]: Start difference. First operand 235 states and 246 transitions. Second operand 17 states. [2018-04-11 17:44:01,703 WARN L151 SmtUtils]: Spent 28875ms on a formula simplification. DAG size of input: 62 DAG size of output 55 Received shutdown request... [2018-04-11 17:44:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 17:44:21,870 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 17:44:21,874 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 17:44:21,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:44:21 BoogieIcfgContainer [2018-04-11 17:44:21,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:44:21,874 INFO L168 Benchmark]: Toolchain (without parser) took 207548.30 ms. Allocated memory was 403.7 MB in the beginning and 1.1 GB in the end (delta: 647.5 MB). Free memory was 335.1 MB in the beginning and 642.4 MB in the end (delta: -307.3 MB). Peak memory consumption was 340.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:44:21,875 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 360.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:44:21,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.96 ms. Allocated memory is still 403.7 MB. Free memory was 335.1 MB in the beginning and 307.0 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-04-11 17:44:21,875 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 403.7 MB. Free memory was 307.0 MB in the beginning and 304.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 17:44:21,876 INFO L168 Benchmark]: RCFGBuilder took 477.91 ms. Allocated memory was 403.7 MB in the beginning and 595.1 MB in the end (delta: 191.4 MB). Free memory was 304.3 MB in the beginning and 515.5 MB in the end (delta: -211.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-04-11 17:44:21,876 INFO L168 Benchmark]: TraceAbstraction took 206785.75 ms. Allocated memory was 595.1 MB in the beginning and 1.1 GB in the end (delta: 456.1 MB). Free memory was 515.5 MB in the beginning and 642.4 MB in the end (delta: -126.9 MB). Peak memory consumption was 329.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:44:21,877 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.13 ms. Allocated memory is still 403.7 MB. Free memory is still 360.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.96 ms. Allocated memory is still 403.7 MB. Free memory was 335.1 MB in the beginning and 307.0 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 403.7 MB. Free memory was 307.0 MB in the beginning and 304.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 477.91 ms. Allocated memory was 403.7 MB in the beginning and 595.1 MB in the end (delta: 191.4 MB). Free memory was 304.3 MB in the beginning and 515.5 MB in the end (delta: -211.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 206785.75 ms. Allocated memory was 595.1 MB in the beginning and 1.1 GB in the end (delta: 456.1 MB). Free memory was 515.5 MB in the beginning and 642.4 MB in the end (delta: -126.9 MB). Peak memory consumption was 329.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (235states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 88. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 137 locations, 55 error locations. TIMEOUT Result, 206.7s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 136.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2378 SDtfs, 11177 SDslu, 13755 SDs, 0 SdLazy, 19194 SolverSat, 1250 SolverUnsat, 127 SolverUnknown, 0 SolverNotchecked, 49.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1519 GetRequests, 707 SyntacticMatches, 14 SemanticMatches, 797 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5923 ImplicationChecksByTransitivity, 115.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=31, 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, 31 MinimizatonAttempts, 1483 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 69.1s InterpolantComputationTime, 2353 NumberOfCodeBlocks, 2353 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1284 ConstructedInterpolants, 561 QuantifiedInterpolants, 3928699 SizeOfPredicates, 387 NumberOfNonLiveVariables, 4329 ConjunctsInSsa, 882 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 36/148 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/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-44-21-882.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-44-21-882.csv Completed graceful shutdown