java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 07:04:33,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 07:04:33,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 07:04:33,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 07:04:33,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 07:04:33,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 07:04:33,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 07:04:33,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 07:04:33,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 07:04:33,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 07:04:33,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 07:04:33,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 07:04:33,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 07:04:33,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 07:04:33,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 07:04:33,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 07:04:33,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 07:04:33,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 07:04:33,788 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 07:04:33,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 07:04:33,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 07:04:33,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 07:04:33,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 07:04:33,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 07:04:33,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 07:04:33,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 07:04:33,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 07:04:33,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 07:04:33,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 07:04:33,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 07:04:33,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 07:04:33,795 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-13 07:04:33,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 07:04:33,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 07:04:33,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 07:04:33,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 07:04:33,806 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 07:04:33,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 07:04:33,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 07:04:33,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 07:04:33,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 07:04:33,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 07:04:33,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 07:04:33,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 07:04:33,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 07:04:33,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 07:04:33,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 07:04:33,808 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 07:04:33,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 07:04:33,809 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 07:04:33,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 07:04:33,846 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 07:04:33,851 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 07:04:33,852 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 07:04:33,853 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 07:04:33,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,164 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd70c3cd80 [2018-04-13 07:04:34,303 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 07:04:34,303 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 07:04:34,304 INFO L168 CDTParser]: Scanning length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,310 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 07:04:34,311 INFO L215 ultiparseSymbolTable]: [2018-04-13 07:04:34,311 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 07:04:34,311 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,311 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,311 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i__append ('append') in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,311 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,311 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 07:04:34,311 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__gid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__off_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ldiv_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____nlink_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_short in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int8_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____mode_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,312 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____timer_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ssize_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sig_atomic_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__key_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ssize_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__nlink_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__timer_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__mode_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,313 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsword_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_short in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int32_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clockid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int8_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____suseconds_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clockid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,314 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pthread_slist_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__quad_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__caddr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fd_mask in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____id_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int16_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_ulong_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_cond_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int32_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,315 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint32_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__div_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blksize_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_spinlock_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__size_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_once_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_quad_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____intptr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,316 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutexattr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_char in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____quad_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____socklen_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__lldiv_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int16_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrier_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_attr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,317 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__wchar_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int16_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlockattr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_char in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__daddr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__sigset_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint16_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_long in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,318 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____gid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____loff_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sigset_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int32_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____dev_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ulong in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_long in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__suseconds_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_mask in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,319 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clock_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____caddr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_set in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__dev_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____key_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__loff_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uint in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint8_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__time_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlock_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_int in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsid_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____qaddr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clock_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____daddr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__id_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blksize_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_condattr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ushort in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_slong_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_quad_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____time_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int8_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_key_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__register_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrierattr_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt64_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutex_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ino_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____useconds_t in length_test03_false-valid-memtrack.i [2018-04-13 07:04:34,334 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd70c3cd80 [2018-04-13 07:04:34,338 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 07:04:34,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 07:04:34,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 07:04:34,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 07:04:34,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 07:04:34,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19db0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34, skipping insertion in model container [2018-04-13 07:04:34,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,358 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 07:04:34,386 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 07:04:34,517 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 07:04:34,552 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 07:04:34,559 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-13 07:04:34,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34 WrapperNode [2018-04-13 07:04:34,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 07:04:34,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 07:04:34,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 07:04:34,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 07:04:34,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (1/1) ... [2018-04-13 07:04:34,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 07:04:34,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 07:04:34,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 07:04:34,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 07:04:34,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (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-13 07:04:34,731 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 07:04:34,731 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 07:04:34,731 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-13 07:04:34,731 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-13 07:04:34,732 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-13 07:04:34,732 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 07:04:34,732 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 07:04:34,733 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 07:04:34,734 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 07:04:34,735 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 07:04:34,736 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 07:04:34,737 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 07:04:34,738 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 07:04:34,739 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 07:04:34,740 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 07:04:34,741 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 07:04:34,742 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 07:04:35,145 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 07:04:35,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:04:35 BoogieIcfgContainer [2018-04-13 07:04:35,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 07:04:35,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 07:04:35,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 07:04:35,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 07:04:35,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:04:34" (1/3) ... [2018-04-13 07:04:35,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4858f67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:04:35, skipping insertion in model container [2018-04-13 07:04:35,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:04:34" (2/3) ... [2018-04-13 07:04:35,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4858f67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:04:35, skipping insertion in model container [2018-04-13 07:04:35,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:04:35" (3/3) ... [2018-04-13 07:04:35,152 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-04-13 07:04:35,160 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 07:04:35,167 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-13 07:04:35,198 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 07:04:35,200 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 07:04:35,200 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 07:04:35,200 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 07:04:35,200 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 07:04:35,200 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 07:04:35,200 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 07:04:35,200 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 07:04:35,201 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 07:04:35,201 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 07:04:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-13 07:04:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 07:04:35,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:35,218 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:35,218 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942715, now seen corresponding path program 1 times [2018-04-13 07:04:35,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:35,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:35,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:35,252 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:35,282 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:35,324 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-13 07:04:35,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:35,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:35,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 07:04:35,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 07:04:35,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 07:04:35,336 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-13 07:04:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:35,574 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-13 07:04:35,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 07:04:35,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 07:04:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:35,586 INFO L225 Difference]: With dead ends: 175 [2018-04-13 07:04:35,587 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 07:04:35,588 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-13 07:04:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 07:04:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-13 07:04:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-13 07:04:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-13 07:04:35,632 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-13 07:04:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:35,632 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-13 07:04:35,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 07:04:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-13 07:04:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 07:04:35,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:35,633 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:35,633 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942716, now seen corresponding path program 1 times [2018-04-13 07:04:35,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:35,633 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:35,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:35,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:35,649 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:35,684 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-13 07:04:35,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:35,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:35,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 07:04:35,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 07:04:35,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 07:04:35,686 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-13 07:04:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:35,785 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-13 07:04:35,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 07:04:35,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 07:04:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:35,786 INFO L225 Difference]: With dead ends: 134 [2018-04-13 07:04:35,786 INFO L226 Difference]: Without dead ends: 134 [2018-04-13 07:04:35,786 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-13 07:04:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-13 07:04:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-13 07:04:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-13 07:04:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-13 07:04:35,792 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-13 07:04:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:35,792 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-13 07:04:35,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 07:04:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-13 07:04:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 07:04:35,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:35,792 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:35,792 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash -643063297, now seen corresponding path program 1 times [2018-04-13 07:04:35,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:35,793 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:35,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:35,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:35,803 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:35,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-13 07:04:35,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:35,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:35,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 07:04:35,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 07:04:35,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 07:04:35,823 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-13 07:04:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:35,912 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-04-13 07:04:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 07:04:35,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-13 07:04:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:35,914 INFO L225 Difference]: With dead ends: 148 [2018-04-13 07:04:35,914 INFO L226 Difference]: Without dead ends: 148 [2018-04-13 07:04:35,914 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-13 07:04:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-13 07:04:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-04-13 07:04:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-13 07:04:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-13 07:04:35,922 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-04-13 07:04:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:35,922 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-13 07:04:35,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 07:04:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-13 07:04:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 07:04:35,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:35,923 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:35,923 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash -643063296, now seen corresponding path program 1 times [2018-04-13 07:04:35,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:35,923 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:35,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:35,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:35,935 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:35,956 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-13 07:04:35,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:35,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:35,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 07:04:35,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 07:04:35,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 07:04:35,957 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 4 states. [2018-04-13 07:04:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:36,024 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-13 07:04:36,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 07:04:36,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-13 07:04:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:36,025 INFO L225 Difference]: With dead ends: 135 [2018-04-13 07:04:36,025 INFO L226 Difference]: Without dead ends: 135 [2018-04-13 07:04:36,025 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-13 07:04:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-13 07:04:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-04-13 07:04:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 07:04:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-13 07:04:36,032 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-13 07:04:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:36,032 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-13 07:04:36,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 07:04:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-13 07:04:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 07:04:36,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:36,033 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] [2018-04-13 07:04:36,033 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976942, now seen corresponding path program 1 times [2018-04-13 07:04:36,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:36,034 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:36,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:36,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:36,050 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:36,068 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-13 07:04:36,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:36,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:36,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 07:04:36,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 07:04:36,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 07:04:36,069 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-13 07:04:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:36,135 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-13 07:04:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 07:04:36,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 07:04:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:36,136 INFO L225 Difference]: With dead ends: 128 [2018-04-13 07:04:36,136 INFO L226 Difference]: Without dead ends: 128 [2018-04-13 07:04:36,136 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-13 07:04:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-13 07:04:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-13 07:04:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 07:04:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-13 07:04:36,141 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-13 07:04:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:36,141 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-13 07:04:36,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 07:04:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-13 07:04:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 07:04:36,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:36,142 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] [2018-04-13 07:04:36,142 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976941, now seen corresponding path program 1 times [2018-04-13 07:04:36,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:36,143 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:36,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:36,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:36,156 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:36,181 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-13 07:04:36,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:36,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 07:04:36,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 07:04:36,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 07:04:36,182 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-13 07:04:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:36,243 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-13 07:04:36,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 07:04:36,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 07:04:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:36,244 INFO L225 Difference]: With dead ends: 123 [2018-04-13 07:04:36,244 INFO L226 Difference]: Without dead ends: 123 [2018-04-13 07:04:36,244 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-13 07:04:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-13 07:04:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-13 07:04:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-13 07:04:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-13 07:04:36,248 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-13 07:04:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:36,248 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-13 07:04:36,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 07:04:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-13 07:04:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 07:04:36,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:36,249 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:36,249 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612264, now seen corresponding path program 1 times [2018-04-13 07:04:36,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:36,250 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:36,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:36,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:36,266 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:36,273 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:36,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:36,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:36,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:36,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:36,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:36,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 07:04:36,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:36,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:36,360 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-13 07:04:36,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,366 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-13 07:04:36,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 07:04:36,420 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 17 treesize of output 20 [2018-04-13 07:04:36,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,425 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-13 07:04:36,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-13 07:04:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:04:36,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:36,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 07:04:36,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 07:04:36,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 07:04:36,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 07:04:36,437 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-04-13 07:04:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:36,695 INFO L93 Difference]: Finished difference Result 238 states and 254 transitions. [2018-04-13 07:04:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 07:04:36,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-13 07:04:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:36,696 INFO L225 Difference]: With dead ends: 238 [2018-04-13 07:04:36,696 INFO L226 Difference]: Without dead ends: 238 [2018-04-13 07:04:36,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 07:04:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-13 07:04:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2018-04-13 07:04:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-13 07:04:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-04-13 07:04:36,702 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 21 [2018-04-13 07:04:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:36,702 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-04-13 07:04:36,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 07:04:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-04-13 07:04:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 07:04:36,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:36,703 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:36,704 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612263, now seen corresponding path program 1 times [2018-04-13 07:04:36,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:36,704 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:36,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:36,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:36,717 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:36,721 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:36,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:36,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:36,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:36,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:36,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:36,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,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 6 treesize of output 5 [2018-04-13 07:04:36,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 07:04:36,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:36,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 07:04:36,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:36,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:36,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, 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-13 07:04:36,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:36,822 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-13 07:04:36,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-13 07:04:36,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:36,899 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 17 treesize of output 28 [2018-04-13 07:04:36,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 07:04:36,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 07:04:36,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:69 [2018-04-13 07:04:36,963 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-13 07:04:36,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:36,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 07:04:36,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 07:04:36,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 07:04:36,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-13 07:04:36,964 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-04-13 07:04:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:37,279 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-13 07:04:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 07:04:37,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-13 07:04:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:37,280 INFO L225 Difference]: With dead ends: 178 [2018-04-13 07:04:37,280 INFO L226 Difference]: Without dead ends: 178 [2018-04-13 07:04:37,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-04-13 07:04:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-13 07:04:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-13 07:04:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-13 07:04:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-04-13 07:04:37,289 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-04-13 07:04:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:37,290 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-04-13 07:04:37,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 07:04:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-04-13 07:04:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 07:04:37,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:37,290 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] [2018-04-13 07:04:37,290 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 945598509, now seen corresponding path program 1 times [2018-04-13 07:04:37,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:37,291 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:37,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:37,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:37,307 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:37,310 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:37,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:37,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:37,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:37,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:37,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:04:37,386 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-13 07:04:37,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 8 treesize of output 7 [2018-04-13 07:04:37,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,397 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-13 07:04:37,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:37,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-04-13 07:04:37,415 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-13 07:04:37,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,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 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 07:04:37,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,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 21 treesize of output 16 [2018-04-13 07:04:37,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,432 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-13 07:04:37,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-13 07:04:37,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,457 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-13 07:04:37,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:53 [2018-04-13 07:04:37,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 07:04:37,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 07:04:37,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 07:04:37,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:37,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-13 07:04:37,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-13 07:04:37,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,561 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-13 07:04:37,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-13 07:04:37,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,590 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-13 07:04:37,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,615 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-13 07:04:37,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:85 [2018-04-13 07:04:37,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 07:04:37,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,784 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-13 07:04:37,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:83 [2018-04-13 07:04:37,864 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 40 treesize of output 34 [2018-04-13 07:04:37,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-13 07:04:37,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:37,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 07:04:37,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:37,890 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-13 07:04:37,890 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:97, output treesize:61 [2018-04-13 07:04:37,944 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-13 07:04:37,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:37,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-13 07:04:37,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 07:04:37,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 07:04:37,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2018-04-13 07:04:37,945 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 16 states. [2018-04-13 07:04:38,237 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-13 07:04:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:38,969 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-13 07:04:38,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 07:04:38,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-13 07:04:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:38,970 INFO L225 Difference]: With dead ends: 178 [2018-04-13 07:04:38,970 INFO L226 Difference]: Without dead ends: 178 [2018-04-13 07:04:38,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=599, Unknown=2, NotChecked=0, Total=756 [2018-04-13 07:04:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-13 07:04:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-13 07:04:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-13 07:04:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-04-13 07:04:38,973 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 30 [2018-04-13 07:04:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:38,974 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-04-13 07:04:38,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 07:04:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-04-13 07:04:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 07:04:38,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:38,974 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:38,974 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 548364848, now seen corresponding path program 1 times [2018-04-13 07:04:38,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:38,975 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:38,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:38,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:38,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:38,987 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:38,991 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:38,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:38,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:38,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:39,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:39,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:39,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:04:39,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, 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-13 07:04:39,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:39,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,076 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-13 07:04:39,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:39,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-13 07:04:39,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,099 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-13 07:04:39,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-13 07:04:39,138 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-13 07:04:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:39,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,156 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-13 07:04:39,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:39,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-13 07:04:39,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-13 07:04:39,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,212 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-13 07:04:39,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-13 07:04:39,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,249 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-13 07:04:39,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,276 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-13 07:04:39,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:68 [2018-04-13 07:04:39,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:39,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 07:04:39,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,384 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-13 07:04:39,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:39,401 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-13 07:04:39,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:67 [2018-04-13 07:04:39,654 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-13 07:04:39,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:39,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-13 07:04:39,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 07:04:39,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 07:04:39,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2018-04-13 07:04:39,655 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 16 states. [2018-04-13 07:04:40,023 WARN L148 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-13 07:04:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:40,718 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2018-04-13 07:04:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 07:04:40,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-04-13 07:04:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:40,719 INFO L225 Difference]: With dead ends: 168 [2018-04-13 07:04:40,719 INFO L226 Difference]: Without dead ends: 168 [2018-04-13 07:04:40,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=650, Unknown=1, NotChecked=0, Total=812 [2018-04-13 07:04:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-13 07:04:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-13 07:04:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 07:04:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-04-13 07:04:40,722 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 32 [2018-04-13 07:04:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:40,722 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-04-13 07:04:40,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 07:04:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-04-13 07:04:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 07:04:40,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:40,723 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] [2018-04-13 07:04:40,723 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1767154905, now seen corresponding path program 1 times [2018-04-13 07:04:40,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:40,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:40,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:40,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:40,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:40,731 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:40,751 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-13 07:04:40,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:04:40,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:04:40,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 07:04:40,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 07:04:40,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 07:04:40,752 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 3 states. [2018-04-13 07:04:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:40,767 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-04-13 07:04:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 07:04:40,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-04-13 07:04:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:40,768 INFO L225 Difference]: With dead ends: 177 [2018-04-13 07:04:40,768 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 07:04:40,768 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 07:04:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 07:04:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-13 07:04:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-13 07:04:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-04-13 07:04:40,772 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 38 [2018-04-13 07:04:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:40,773 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-04-13 07:04:40,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 07:04:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-04-13 07:04:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 07:04:40,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:40,774 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:04:40,774 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1625593294, now seen corresponding path program 1 times [2018-04-13 07:04:40,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:40,774 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:40,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:40,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:40,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:40,794 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:40,801 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:40,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:40,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:40,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:40,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:40,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:40,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:40,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, 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-13 07:04:40,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:40,923 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 14 treesize of output 17 [2018-04-13 07:04:40,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:40,927 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-13 07:04:40,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-13 07:04:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:04:40,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:04:40,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 07:04:40,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 07:04:40,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 07:04:40,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-13 07:04:40,941 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 10 states. [2018-04-13 07:04:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:41,193 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-13 07:04:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 07:04:41,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-04-13 07:04:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:41,194 INFO L225 Difference]: With dead ends: 177 [2018-04-13 07:04:41,194 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 07:04:41,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-13 07:04:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 07:04:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-13 07:04:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-13 07:04:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-13 07:04:41,199 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 41 [2018-04-13 07:04:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:41,199 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-13 07:04:41,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 07:04:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-13 07:04:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 07:04:41,200 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:41,200 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] [2018-04-13 07:04:41,200 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230466, now seen corresponding path program 1 times [2018-04-13 07:04:41,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:41,201 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:41,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:41,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:41,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:41,214 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:41,218 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:41,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:41,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:41,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:41,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:41,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 07:04:41,271 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| Int)) (and (= (select |c_old(#valid)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base|) 0) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-13 07:04:41,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,282 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-13 07:04:41,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,287 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-13 07:04:41,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 07:04:41,322 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 17 treesize of output 20 [2018-04-13 07:04:41,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,328 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-13 07:04:41,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-13 07:04:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-13 07:04:41,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:04:41,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 07:04:41,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 07:04:41,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 07:04:41,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-04-13 07:04:41,349 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-04-13 07:04:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:41,643 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-04-13 07:04:41,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 07:04:41,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-13 07:04:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:41,645 INFO L225 Difference]: With dead ends: 275 [2018-04-13 07:04:41,645 INFO L226 Difference]: Without dead ends: 275 [2018-04-13 07:04:41,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2018-04-13 07:04:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-13 07:04:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2018-04-13 07:04:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-13 07:04:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-04-13 07:04:41,649 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 43 [2018-04-13 07:04:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:41,650 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-04-13 07:04:41,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 07:04:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-04-13 07:04:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 07:04:41,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:41,650 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] [2018-04-13 07:04:41,650 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230465, now seen corresponding path program 1 times [2018-04-13 07:04:41,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:41,651 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:41,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:41,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:41,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:41,661 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:41,664 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:41,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:41,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:41,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:41,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 07:04:41,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 07:04:41,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 07:04:41,767 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| Int)) (and (= (select |c_old(#valid)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base|) 0) (= (store |c_old(#length)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| 9) |c_#length|))) is different from true [2018-04-13 07:04:41,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 07:04:41,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,786 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-13 07:04:41,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:41,791 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-13 07:04:41,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-13 07:04:41,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:41,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 07:04:41,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 07:04:41,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 07:04:41,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:44 [2018-04-13 07:04:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-13 07:04:41,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:04:41,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 07:04:41,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 07:04:41,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 07:04:41,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-04-13 07:04:41,896 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 11 states. [2018-04-13 07:04:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:42,231 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2018-04-13 07:04:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 07:04:42,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-13 07:04:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:42,233 INFO L225 Difference]: With dead ends: 268 [2018-04-13 07:04:42,233 INFO L226 Difference]: Without dead ends: 268 [2018-04-13 07:04:42,234 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2018-04-13 07:04:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-13 07:04:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-04-13 07:04:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-13 07:04:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2018-04-13 07:04:42,240 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 43 [2018-04-13 07:04:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:42,240 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2018-04-13 07:04:42,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 07:04:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2018-04-13 07:04:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 07:04:42,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:42,241 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-13 07:04:42,242 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash 771137816, now seen corresponding path program 1 times [2018-04-13 07:04:42,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:42,242 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:42,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:42,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:42,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:42,255 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:42,260 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:42,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:42,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:42,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:42,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:42,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 07:04:42,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:04:42,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,324 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-13 07:04:42,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,330 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-13 07:04:42,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-13 07:04:42,415 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-13 07:04:42,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:42,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,426 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-13 07:04:42,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-13 07:04:42,450 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-13 07:04:42,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:42,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,472 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-13 07:04:42,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-13 07:04:42,519 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 64 treesize of output 61 [2018-04-13 07:04:42,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,523 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 57 treesize of output 72 [2018-04-13 07:04:42,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 63 [2018-04-13 07:04:42,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 07:04:42,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:04:42,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 07:04:42,581 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:107 [2018-04-13 07:04:42,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,661 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 83 treesize of output 97 [2018-04-13 07:04:42,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 07:04:42,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:141, output treesize:91 [2018-04-13 07:04:42,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:42,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2018-04-13 07:04:42,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,809 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-13 07:04:42,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-13 07:04:42,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-13 07:04:42,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:42,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:42,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 07:04:42,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-13 07:04:42,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-13 07:04:43,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:43,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:43,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:43,046 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-13 07:04:43,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-13 07:04:43,101 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 73 [2018-04-13 07:04:43,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:43,104 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 15 treesize of output 8 [2018-04-13 07:04:43,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:43,114 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:43,115 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 41 treesize of output 25 [2018-04-13 07:04:43,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:43,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 07:04:43,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:43,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:43,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 07:04:43,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:132, output treesize:45 [2018-04-13 07:04:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:04:43,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:04:43,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 07:04:43,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 07:04:43,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 07:04:43,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-04-13 07:04:43,207 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 21 states. [2018-04-13 07:04:44,388 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 123 DAG size of output 85 [2018-04-13 07:04:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:04:44,981 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2018-04-13 07:04:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 07:04:44,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-13 07:04:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:04:44,982 INFO L225 Difference]: With dead ends: 312 [2018-04-13 07:04:44,982 INFO L226 Difference]: Without dead ends: 312 [2018-04-13 07:04:44,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 07:04:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-13 07:04:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 265. [2018-04-13 07:04:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 07:04:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-04-13 07:04:44,993 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 50 [2018-04-13 07:04:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:04:44,994 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-04-13 07:04:44,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 07:04:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-04-13 07:04:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 07:04:44,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:04:44,996 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-13 07:04:44,996 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:04:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 771137817, now seen corresponding path program 1 times [2018-04-13 07:04:44,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:04:44,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:04:44,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:44,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:04:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:45,018 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:04:45,025 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:04:45,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:04:45,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:04:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:04:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:04:45,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:04:45,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:45,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:04:45,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 07:04:45,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,124 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-13 07:04:45,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 07:04:45,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:45,380 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 28 treesize of output 26 [2018-04-13 07:04:45,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-04-13 07:04:45,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-13 07:04:45,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:45,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-04-13 07:04:45,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-13 07:04:45,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,485 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-13 07:04:45,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:04:45,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:04:45,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:48 [2018-04-13 07:04:45,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 58 [2018-04-13 07:04:45,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-13 07:04:45,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,600 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 38 treesize of output 48 [2018-04-13 07:04:45,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-13 07:04:45,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,643 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-13 07:04:45,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:72 [2018-04-13 07:04:45,684 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 146 treesize of output 135 [2018-04-13 07:04:45,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,687 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 139 treesize of output 166 [2018-04-13 07:04:45,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 145 [2018-04-13 07:04:45,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 07:04:45,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:04:45,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:45,823 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 111 treesize of output 103 [2018-04-13 07:04:45,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:45,826 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 93 treesize of output 57 [2018-04-13 07:04:45,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 157 [2018-04-13 07:04:45,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,857 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 154 treesize of output 181 [2018-04-13 07:04:45,857 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:45,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 07:04:45,955 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:177, output treesize:220 [2018-04-13 07:04:45,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:45,999 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 165 treesize of output 159 [2018-04-13 07:04:46,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:04:46,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:236, output treesize:159 [2018-04-13 07:04:46,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,132 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 17 treesize of output 10 [2018-04-13 07:04:46,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,157 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 26 treesize of output 35 [2018-04-13 07:04:46,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,175 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-13 07:04:46,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:173, output treesize:166 [2018-04-13 07:04:46,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 153 [2018-04-13 07:04:46,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:46,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,360 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 135 treesize of output 167 [2018-04-13 07:04:46,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 139 [2018-04-13 07:04:46,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:46,531 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 127 treesize of output 168 [2018-04-13 07:04:46,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:04:46,686 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 159 treesize of output 146 [2018-04-13 07:04:46,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,717 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:46,720 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 43 treesize of output 76 [2018-04-13 07:04:46,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 194 [2018-04-13 07:04:46,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:46,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:46,777 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 171 treesize of output 198 [2018-04-13 07:04:46,778 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:46,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 173 [2018-04-13 07:04:46,917 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,040 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:04:47,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-13 07:04:47,087 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:198, output treesize:324 [2018-04-13 07:04:47,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 202 [2018-04-13 07:04:47,251 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 207 treesize of output 208 [2018-04-13 07:04:47,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 201 [2018-04-13 07:04:47,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:47,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:47,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:47,576 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:47,577 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 188 treesize of output 232 [2018-04-13 07:04:47,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 190 [2018-04-13 07:04:47,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:47,807 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 194 treesize of output 182 [2018-04-13 07:04:47,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:47,809 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 33 treesize of output 33 [2018-04-13 07:04:47,809 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,828 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,889 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:47,890 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 164 treesize of output 147 [2018-04-13 07:04:47,892 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:47,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:47,895 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 52 treesize of output 80 [2018-04-13 07:04:47,895 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,909 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:47,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 07:04:47,949 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:393, output treesize:332 [2018-04-13 07:04:48,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 197 [2018-04-13 07:04:48,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,057 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,059 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,059 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 211 [2018-04-13 07:04:48,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,155 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,155 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 186 treesize of output 158 [2018-04-13 07:04:48,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,232 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 156 [2018-04-13 07:04:48,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,313 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 141 treesize of output 135 [2018-04-13 07:04:48,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:04:48,596 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 157 treesize of output 136 [2018-04-13 07:04:48,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,599 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 77 treesize of output 97 [2018-04-13 07:04:48,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,621 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 103 treesize of output 57 [2018-04-13 07:04:48,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,633 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,698 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 76 treesize of output 64 [2018-04-13 07:04:48,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 07:04:48,700 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-13 07:04:48,712 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,720 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,776 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 115 treesize of output 103 [2018-04-13 07:04:48,790 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2018-04-13 07:04:48,793 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,835 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 58 treesize of output 52 [2018-04-13 07:04:48,835 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,866 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 110 [2018-04-13 07:04:48,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,882 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:04:48,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:04:48,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 108 [2018-04-13 07:04:48,884 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,955 INFO L267 ElimStorePlain]: Start of recursive call 16: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:04:48,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 07:04:48,984 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 13 variables, input treesize:366, output treesize:69 [2018-04-13 07:04:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:04:49,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:04:49,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 07:04:49,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 07:04:49,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 07:04:49,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=623, Unknown=4, NotChecked=0, Total=702 [2018-04-13 07:04:49,045 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 27 states. [2018-04-13 07:05:25,189 WARN L151 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 138 DAG size of output 129 [2018-04-13 07:05:25,597 WARN L151 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-04-13 07:05:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:05:32,896 INFO L93 Difference]: Finished difference Result 323 states and 378 transitions. [2018-04-13 07:05:32,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 07:05:32,897 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-04-13 07:05:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:05:32,898 INFO L225 Difference]: With dead ends: 323 [2018-04-13 07:05:32,899 INFO L226 Difference]: Without dead ends: 323 [2018-04-13 07:05:32,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=419, Invalid=2330, Unknown=7, NotChecked=0, Total=2756 [2018-04-13 07:05:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-13 07:05:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 288. [2018-04-13 07:05:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-13 07:05:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2018-04-13 07:05:32,906 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 50 [2018-04-13 07:05:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:05:32,907 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2018-04-13 07:05:32,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 07:05:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2018-04-13 07:05:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 07:05:32,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:05:32,908 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:05:32,908 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:05:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1788489223, now seen corresponding path program 1 times [2018-04-13 07:05:32,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:05:32,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:05:32,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:05:32,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:05:32,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:05:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:05:32,925 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:05:32,929 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:05:32,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:05:32,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:05:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:05:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:05:32,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:05:32,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:05:32,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:32,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:32,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 07:05:32,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:32,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:32,990 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-13 07:05:32,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:32,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:32,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-13 07:05:33,018 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-13 07:05:33,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:05:33,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 07:05:33,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 07:05:33,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-13 07:05:33,078 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-13 07:05:33,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,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, 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-13 07:05:33,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,100 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-13 07:05:33,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,103 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-13 07:05:33,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-13 07:05:33,298 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base)))) (store .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= (select |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 1)) (= (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset)))) (store .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-04-13 07:05:33,454 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-04-13 07:05:33,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,463 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 22 treesize of output 34 [2018-04-13 07:05:33,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-13 07:05:33,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 [2018-04-13 07:05:33,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,537 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-13 07:05:33,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,594 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 51 treesize of output 60 [2018-04-13 07:05:33,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-13 07:05:33,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:05:33,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,607 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,670 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 48 treesize of output 60 [2018-04-13 07:05:33,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-13 07:05:33,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 07:05:33,674 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,679 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,696 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 51 treesize of output 60 [2018-04-13 07:05:33,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2018-04-13 07:05:33,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:05:33,700 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,704 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,712 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,720 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 07:05:33,745 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:152, output treesize:194 [2018-04-13 07:05:33,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:05:33,905 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 27 treesize of output 43 [2018-04-13 07:05:33,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:05:33,937 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-13 07:05:33,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:202, output treesize:194 [2018-04-13 07:05:55,582 WARN L148 SmtUtils]: Spent 2732ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-13 07:06:17,834 WARN L148 SmtUtils]: Spent 2748ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-13 07:06:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:06:27,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:06:27,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 07:06:27,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 07:06:27,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 07:06:27,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=389, Unknown=26, NotChecked=40, Total=506 [2018-04-13 07:06:27,148 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand 23 states. [2018-04-13 07:07:16,570 WARN L151 SmtUtils]: Spent 9447ms on a formula simplification. DAG size of input: 131 DAG size of output 123 [2018-04-13 07:07:24,994 WARN L151 SmtUtils]: Spent 8234ms on a formula simplification. DAG size of input: 144 DAG size of output 126 [2018-04-13 07:07:34,504 WARN L151 SmtUtils]: Spent 9418ms on a formula simplification. DAG size of input: 153 DAG size of output 135 [2018-04-13 07:07:44,044 WARN L151 SmtUtils]: Spent 9464ms on a formula simplification. DAG size of input: 213 DAG size of output 136 [2018-04-13 07:08:04,131 WARN L148 SmtUtils]: Spent 5415ms on a formula simplification that was a NOOP. DAG size: 73 [2018-04-13 07:09:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:09:00,660 INFO L93 Difference]: Finished difference Result 326 states and 373 transitions. [2018-04-13 07:09:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 07:09:00,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-13 07:09:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:09:00,661 INFO L225 Difference]: With dead ends: 326 [2018-04-13 07:09:00,662 INFO L226 Difference]: Without dead ends: 326 [2018-04-13 07:09:00,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 112.9s TimeCoverageRelationStatistics Valid=155, Invalid=999, Unknown=40, NotChecked=66, Total=1260 [2018-04-13 07:09:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-13 07:09:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 288. [2018-04-13 07:09:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-13 07:09:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 336 transitions. [2018-04-13 07:09:00,670 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 336 transitions. Word has length 52 [2018-04-13 07:09:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:09:00,671 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 336 transitions. [2018-04-13 07:09:00,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 07:09:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 336 transitions. [2018-04-13 07:09:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 07:09:00,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:09:00,672 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:09:00,672 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:09:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1182477942, now seen corresponding path program 1 times [2018-04-13 07:09:00,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:09:00,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:09:00,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:09:00,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:09:00,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:09:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:09:00,691 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:09:00,698 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:09:00,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:09:00,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:09:00,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:09:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:09:00,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:09:00,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 6 treesize of output 5 [2018-04-13 07:09:00,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:09:00,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:00,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:00,778 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-13 07:09:00,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-13 07:09:00,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 07:09:00,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 07:09:00,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 07:09:00,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:09:00,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:00,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-13 07:09:01,000 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base)))) (store .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= (select |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 1)) (= (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset)))) (store .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-04-13 07:09:01,109 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-04-13 07:09:01,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,115 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 22 treesize of output 34 [2018-04-13 07:09:01,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-04-13 07:09:01,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, 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 16 [2018-04-13 07:09:01,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,165 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-13 07:09:01,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-04-13 07:09:01,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2018-04-13 07:09:01,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:09:01,199 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,204 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,253 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 41 treesize of output 53 [2018-04-13 07:09:01,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-13 07:09:01,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 07:09:01,257 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,263 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,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 44 treesize of output 53 [2018-04-13 07:09: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-13 07:09:01,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:09:01,282 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,285 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,293 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,299 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 07:09:01,320 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:135, output treesize:177 [2018-04-13 07:09:01,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:09:01,492 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 27 treesize of output 43 [2018-04-13 07:09:01,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:09:01,571 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-13 07:09:01,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:178, output treesize:170 [2018-04-13 07:09:04,390 WARN L148 SmtUtils]: Spent 2728ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-13 07:09:07,372 WARN L148 SmtUtils]: Spent 2747ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-13 07:09:10,152 WARN L148 SmtUtils]: Spent 2730ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-13 07:09:18,396 WARN L151 SmtUtils]: Spent 8198ms on a formula simplification. DAG size of input: 66 DAG size of output 56 [2018-04-13 07:09:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:09:18,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:09:18,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 07:09:18,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 07:09:18,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 07:09:18,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=407, Unknown=8, NotChecked=40, Total=506 [2018-04-13 07:09:18,411 INFO L87 Difference]: Start difference. First operand 288 states and 336 transitions. Second operand 23 states. [2018-04-13 07:09:27,552 WARN L151 SmtUtils]: Spent 8034ms on a formula simplification. DAG size of input: 115 DAG size of output 101 [2018-04-13 07:09:35,359 WARN L151 SmtUtils]: Spent 7759ms on a formula simplification. DAG size of input: 128 DAG size of output 104 [2018-04-13 07:09:41,966 WARN L151 SmtUtils]: Spent 6526ms on a formula simplification. DAG size of input: 131 DAG size of output 105 [2018-04-13 07:09:48,773 WARN L151 SmtUtils]: Spent 6747ms on a formula simplification. DAG size of input: 136 DAG size of output 112 [2018-04-13 07:10:01,137 WARN L151 SmtUtils]: Spent 12241ms on a formula simplification. DAG size of input: 131 DAG size of output 117 [2018-04-13 07:10:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:01,931 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2018-04-13 07:10:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 07:10:01,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-13 07:10:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:01,932 INFO L225 Difference]: With dead ends: 314 [2018-04-13 07:10:01,932 INFO L226 Difference]: Without dead ends: 314 [2018-04-13 07:10:01,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=147, Invalid=961, Unknown=18, NotChecked=64, Total=1190 [2018-04-13 07:10:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-13 07:10:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2018-04-13 07:10:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-13 07:10:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 325 transitions. [2018-04-13 07:10:01,938 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 325 transitions. Word has length 54 [2018-04-13 07:10:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:01,938 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 325 transitions. [2018-04-13 07:10:01,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 07:10:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 325 transitions. [2018-04-13 07:10:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 07:10:01,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:01,939 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:10:01,939 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash -298162330, now seen corresponding path program 1 times [2018-04-13 07:10:01,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:01,940 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:01,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:01,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:01,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:01,951 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-13 07:10:01,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:01,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:01,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:01,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-13 07:10:02,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 07:10:02,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-13 07:10:02,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 07:10:02,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 07:10:02,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 07:10:02,002 INFO L87 Difference]: Start difference. First operand 280 states and 325 transitions. Second operand 5 states. [2018-04-13 07:10:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:02,024 INFO L93 Difference]: Finished difference Result 316 states and 365 transitions. [2018-04-13 07:10:02,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 07:10:02,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-04-13 07:10:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:02,026 INFO L225 Difference]: With dead ends: 316 [2018-04-13 07:10:02,026 INFO L226 Difference]: Without dead ends: 316 [2018-04-13 07:10:02,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 07:10:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-13 07:10:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 297. [2018-04-13 07:10:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-13 07:10:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 348 transitions. [2018-04-13 07:10:02,032 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 348 transitions. Word has length 58 [2018-04-13 07:10:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:02,033 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 348 transitions. [2018-04-13 07:10:02,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 07:10:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 348 transitions. [2018-04-13 07:10:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-13 07:10:02,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:02,034 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-13 07:10:02,034 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1031327766, now seen corresponding path program 1 times [2018-04-13 07:10:02,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:02,034 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:02,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:02,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:02,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:02,044 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 07:10:02,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 07:10:02,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 07:10:02,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 07:10:02,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 07:10:02,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 07:10:02,071 INFO L87 Difference]: Start difference. First operand 297 states and 348 transitions. Second operand 3 states. [2018-04-13 07:10:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:02,078 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2018-04-13 07:10:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 07:10:02,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-04-13 07:10:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:02,079 INFO L225 Difference]: With dead ends: 293 [2018-04-13 07:10:02,079 INFO L226 Difference]: Without dead ends: 293 [2018-04-13 07:10:02,079 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 07:10:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-13 07:10:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-04-13 07:10:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-13 07:10:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 338 transitions. [2018-04-13 07:10:02,085 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 338 transitions. Word has length 61 [2018-04-13 07:10:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:02,085 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 338 transitions. [2018-04-13 07:10:02,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 07:10:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 338 transitions. [2018-04-13 07:10:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 07:10:02,086 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:02,086 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:10:02,086 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:02,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1293139346, now seen corresponding path program 1 times [2018-04-13 07:10:02,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:02,086 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:02,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:02,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:02,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:02,098 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:02,101 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:02,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:02,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:02,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:02,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:02,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,200 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 14 treesize of output 17 [2018-04-13 07:10:02,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,212 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-13 07:10:02,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,218 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-13 07:10:02,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-13 07:10:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 07:10:02,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:02,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 07:10:02,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 07:10:02,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 07:10:02,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-13 07:10:02,242 INFO L87 Difference]: Start difference. First operand 293 states and 338 transitions. Second operand 10 states. [2018-04-13 07:10:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:02,548 INFO L93 Difference]: Finished difference Result 376 states and 422 transitions. [2018-04-13 07:10:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 07:10:02,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-04-13 07:10:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:02,549 INFO L225 Difference]: With dead ends: 376 [2018-04-13 07:10:02,550 INFO L226 Difference]: Without dead ends: 376 [2018-04-13 07:10:02,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-13 07:10:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-13 07:10:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 346. [2018-04-13 07:10:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-13 07:10:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 405 transitions. [2018-04-13 07:10:02,556 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 405 transitions. Word has length 63 [2018-04-13 07:10:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:02,556 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 405 transitions. [2018-04-13 07:10:02,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 07:10:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 405 transitions. [2018-04-13 07:10:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 07:10:02,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:02,557 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:10:02,557 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:02,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2092504308, now seen corresponding path program 1 times [2018-04-13 07:10:02,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:02,558 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:02,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:02,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:02,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:02,571 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:02,575 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:02,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:02,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:02,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:02,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:02,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-13 07:10:02,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, 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-13 07:10:02,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-13 07:10:02,723 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-13 07:10:02,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,725 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-13 07:10:02,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,739 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-13 07:10:02,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-04-13 07:10:02,777 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 30 treesize of output 40 [2018-04-13 07:10:02,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-13 07:10:02,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,825 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 26 treesize of output 53 [2018-04-13 07:10:02,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 07:10:02,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 07:10:02,874 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 3 xjuncts. [2018-04-13 07:10:02,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:116 [2018-04-13 07:10:02,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:02,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-13 07:10:02,964 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 33 treesize of output 31 [2018-04-13 07:10:02,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:02,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:03,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-13 07:10:03,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,016 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 25 treesize of output 68 [2018-04-13 07:10:03,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:03,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:03,072 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2018-04-13 07:10:03,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 91 [2018-04-13 07:10:03,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 07:10:03,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:03,130 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 54 treesize of output 67 [2018-04-13 07:10:03,131 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:03,163 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:03,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-13 07:10:03,198 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:162, output treesize:185 [2018-04-13 07:10:05,257 WARN L148 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 78 [2018-04-13 07:10:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 07:10:05,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:05,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 07:10:05,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 07:10:05,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 07:10:05,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=394, Unknown=2, NotChecked=0, Total=462 [2018-04-13 07:10:05,528 INFO L87 Difference]: Start difference. First operand 346 states and 405 transitions. Second operand 22 states. [2018-04-13 07:10:08,451 WARN L151 SmtUtils]: Spent 2301ms on a formula simplification. DAG size of input: 58 DAG size of output 57 [2018-04-13 07:10:12,696 WARN L151 SmtUtils]: Spent 4202ms on a formula simplification. DAG size of input: 96 DAG size of output 95 [2018-04-13 07:10:14,776 WARN L148 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 81 [2018-04-13 07:10:16,826 WARN L148 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-13 07:10:20,912 WARN L151 SmtUtils]: Spent 4057ms on a formula simplification. DAG size of input: 87 DAG size of output 87 [2018-04-13 07:10:21,061 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 90 DAG size of output 90 [2018-04-13 07:10:21,244 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 91 DAG size of output 90 [2018-04-13 07:10:21,394 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 95 DAG size of output 94 [2018-04-13 07:10:21,571 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 99 DAG size of output 98 [2018-04-13 07:10:21,807 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 96 DAG size of output 95 [2018-04-13 07:10:22,060 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-04-13 07:10:22,352 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 108 DAG size of output 104 [2018-04-13 07:10:22,788 WARN L151 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 94 DAG size of output 93 [2018-04-13 07:10:23,029 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 101 DAG size of output 97 [2018-04-13 07:10:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:23,870 INFO L93 Difference]: Finished difference Result 338 states and 384 transitions. [2018-04-13 07:10:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 07:10:23,870 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-04-13 07:10:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:23,871 INFO L225 Difference]: With dead ends: 338 [2018-04-13 07:10:23,871 INFO L226 Difference]: Without dead ends: 337 [2018-04-13 07:10:23,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=560, Invalid=2299, Unknown=3, NotChecked=0, Total=2862 [2018-04-13 07:10:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-13 07:10:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-04-13 07:10:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-13 07:10:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 352 transitions. [2018-04-13 07:10:23,878 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 352 transitions. Word has length 63 [2018-04-13 07:10:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:23,878 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 352 transitions. [2018-04-13 07:10:23,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 07:10:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 352 transitions. [2018-04-13 07:10:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-13 07:10:23,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:23,879 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:10:23,879 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:23,879 INFO L82 PathProgramCache]: Analyzing trace with hash 673668519, now seen corresponding path program 1 times [2018-04-13 07:10:23,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:23,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:23,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:23,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:23,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:23,892 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:23,895 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:23,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:23,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:23,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:23,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:23,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 07:10:23,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:23,996 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-13 07:10:23,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 07:10:24,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,040 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-13 07:10:24,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,044 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-13 07:10:24,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 07:10:24,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,070 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 22 treesize of output 34 [2018-04-13 07:10:24,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,077 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-13 07:10:24,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:28 [2018-04-13 07:10:24,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-04-13 07:10:24,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,146 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-13 07:10:24,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 [2018-04-13 07:10:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-13 07:10:24,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:24,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 07:10:24,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 07:10:24,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 07:10:24,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-13 07:10:24,165 INFO L87 Difference]: Start difference. First operand 311 states and 352 transitions. Second operand 11 states. [2018-04-13 07:10:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:24,658 INFO L93 Difference]: Finished difference Result 351 states and 379 transitions. [2018-04-13 07:10:24,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 07:10:24,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-04-13 07:10:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:24,659 INFO L225 Difference]: With dead ends: 351 [2018-04-13 07:10:24,659 INFO L226 Difference]: Without dead ends: 351 [2018-04-13 07:10:24,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-04-13 07:10:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-13 07:10:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 265. [2018-04-13 07:10:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 07:10:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 289 transitions. [2018-04-13 07:10:24,664 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 289 transitions. Word has length 65 [2018-04-13 07:10:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:24,664 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 289 transitions. [2018-04-13 07:10:24,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 07:10:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 289 transitions. [2018-04-13 07:10:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-13 07:10:24,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:24,665 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:10:24,665 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 673668520, now seen corresponding path program 1 times [2018-04-13 07:10:24,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:24,665 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:24,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:24,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:24,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:24,685 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:24,691 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:24,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:24,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:24,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:24,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 6 treesize of output 5 [2018-04-13 07:10:24,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:24,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 07:10:24,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 07:10:24,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,924 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-13 07:10:24,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,933 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-13 07:10:24,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-04-13 07:10:24,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 07:10:24,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:24,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:24,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-04-13 07:10:24,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:25,003 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-13 07:10:25,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:26 [2018-04-13 07:10:25,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:25,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:25,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:25,062 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 2 case distinctions, treesize of input 22 treesize of output 37 [2018-04-13 07:10:25,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 07:10:25,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 07:10:25,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:66 [2018-04-13 07:10:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 07:10:25,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:25,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 07:10:25,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 07:10:25,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 07:10:25,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-13 07:10:25,147 INFO L87 Difference]: Start difference. First operand 265 states and 289 transitions. Second operand 19 states. [2018-04-13 07:10:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:26,422 INFO L93 Difference]: Finished difference Result 412 states and 441 transitions. [2018-04-13 07:10:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 07:10:26,422 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-04-13 07:10:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:26,423 INFO L225 Difference]: With dead ends: 412 [2018-04-13 07:10:26,423 INFO L226 Difference]: Without dead ends: 412 [2018-04-13 07:10:26,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=892, Unknown=2, NotChecked=0, Total=1056 [2018-04-13 07:10:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-13 07:10:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 331. [2018-04-13 07:10:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-04-13 07:10:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 381 transitions. [2018-04-13 07:10:26,427 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 381 transitions. Word has length 65 [2018-04-13 07:10:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:26,427 INFO L459 AbstractCegarLoop]: Abstraction has 331 states and 381 transitions. [2018-04-13 07:10:26,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 07:10:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 381 transitions. [2018-04-13 07:10:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 07:10:26,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:26,427 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-04-13 07:10:26,427 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1088555564, now seen corresponding path program 1 times [2018-04-13 07:10:26,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:26,428 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:26,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:26,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:26,438 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:26,441 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:26,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:26,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:26,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:26,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:26,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:26,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:10:26,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,590 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-13 07:10:26,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,597 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-13 07:10:26,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-13 07:10:26,726 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-13 07:10:26,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 07:10:26,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,737 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-13 07:10:26,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-13 07:10:26,775 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-13 07:10:26,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:26,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,804 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-13 07:10:26,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-13 07:10:26,847 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 64 treesize of output 61 [2018-04-13 07:10:26,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,850 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 57 treesize of output 72 [2018-04-13 07:10:26,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 63 [2018-04-13 07:10:26,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 07:10:26,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:26,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 07:10:26,945 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:107 [2018-04-13 07:10:26,982 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 07:10:26,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:26,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:26,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:27,000 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 34 treesize of output 52 [2018-04-13 07:10:27,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:27,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:141, output treesize:91 [2018-04-13 07:10:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:27,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:27,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:27,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:27,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2018-04-13 07:10:27,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,119 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-13 07:10:27,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-13 07:10:27,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-13 07:10:27,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 07:10:27,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:27,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-13 07:10:27,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-13 07:10:27,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:27,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,315 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-13 07:10:27,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-13 07:10:27,373 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 71 [2018-04-13 07:10:27,375 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:27,375 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 39 treesize of output 23 [2018-04-13 07:10:27,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 07:10:27,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 07:10:27,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:27,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:27,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:127, output treesize:45 [2018-04-13 07:10:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 07:10:27,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:27,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 07:10:27,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 07:10:27,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 07:10:27,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-04-13 07:10:27,461 INFO L87 Difference]: Start difference. First operand 331 states and 381 transitions. Second operand 24 states. [2018-04-13 07:10:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:28,969 INFO L93 Difference]: Finished difference Result 483 states and 569 transitions. [2018-04-13 07:10:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 07:10:28,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-04-13 07:10:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:28,970 INFO L225 Difference]: With dead ends: 483 [2018-04-13 07:10:28,970 INFO L226 Difference]: Without dead ends: 483 [2018-04-13 07:10:28,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=1803, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 07:10:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-13 07:10:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 381. [2018-04-13 07:10:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-13 07:10:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 443 transitions. [2018-04-13 07:10:28,977 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 443 transitions. Word has length 72 [2018-04-13 07:10:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:28,977 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 443 transitions. [2018-04-13 07:10:28,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 07:10:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 443 transitions. [2018-04-13 07:10:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 07:10:28,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:28,978 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-04-13 07:10:28,978 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1088555563, now seen corresponding path program 1 times [2018-04-13 07:10:28,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:28,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:28,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:28,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:28,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:28,997 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:29,003 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:29,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:29,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:29,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:29,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:29,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:10:29,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,154 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-13 07:10:29,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,161 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-13 07:10:29,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-13 07:10:29,298 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-13 07:10:29,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:29,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,312 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-13 07:10:29,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:29,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-04-13 07:10:29,358 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-13 07:10:29,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:29,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,394 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 53 [2018-04-13 07:10:29,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-13 07:10:29,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:67 [2018-04-13 07:10:29,468 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 146 treesize of output 135 [2018-04-13 07:10:29,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 145 [2018-04-13 07:10:29,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 07:10:29,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,547 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 129 treesize of output 156 [2018-04-13 07:10:29,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:29,639 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 154 treesize of output 152 [2018-04-13 07:10:29,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,642 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 147 treesize of output 174 [2018-04-13 07:10:29,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,707 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:29,707 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 114 treesize of output 104 [2018-04-13 07:10:29,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,710 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:29,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 60 [2018-04-13 07:10:29,711 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,722 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:29,748 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:172, output treesize:211 [2018-04-13 07:10:29,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 168 [2018-04-13 07:10:29,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:29,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:240, output treesize:151 [2018-04-13 07:10:29,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:29,999 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-13 07:10:29,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-13 07:10:30,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:129 [2018-04-13 07:10:30,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 128 [2018-04-13 07:10:30,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:30,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,191 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 113 treesize of output 113 [2018-04-13 07:10:30,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 07:10:30,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,266 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-13 07:10:30,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:129 [2018-04-13 07:10:30,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 109 treesize of output 126 [2018-04-13 07:10:30,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 07:10:30,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,311 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 111 treesize of output 111 [2018-04-13 07:10:30,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:30,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,339 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-13 07:10:30,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:140 [2018-04-13 07:10:30,406 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 114 treesize of output 92 [2018-04-13 07:10:30,409 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 61 treesize of output 46 [2018-04-13 07:10:30,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:30,425 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 16 [2018-04-13 07:10:30,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,446 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 66 treesize of output 60 [2018-04-13 07:10:30,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-13 07:10:30,447 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:30,456 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 15 treesize of output 8 [2018-04-13 07:10:30,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:30,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:30,467 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:151, output treesize:23 [2018-04-13 07:10:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 07:10:30,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:30,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 07:10:30,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 07:10:30,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 07:10:30,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-04-13 07:10:30,520 INFO L87 Difference]: Start difference. First operand 381 states and 443 transitions. Second operand 24 states. [2018-04-13 07:10:31,675 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-04-13 07:10:31,811 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 106 DAG size of output 76 [2018-04-13 07:10:32,023 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 114 DAG size of output 84 [2018-04-13 07:10:32,216 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 125 DAG size of output 95 [2018-04-13 07:10:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:32,706 INFO L93 Difference]: Finished difference Result 484 states and 569 transitions. [2018-04-13 07:10:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 07:10:32,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-04-13 07:10:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:32,707 INFO L225 Difference]: With dead ends: 484 [2018-04-13 07:10:32,707 INFO L226 Difference]: Without dead ends: 484 [2018-04-13 07:10:32,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=271, Invalid=1798, Unknown=1, NotChecked=0, Total=2070 [2018-04-13 07:10:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-13 07:10:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 381. [2018-04-13 07:10:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-13 07:10:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 441 transitions. [2018-04-13 07:10:32,712 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 441 transitions. Word has length 72 [2018-04-13 07:10:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:32,712 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 441 transitions. [2018-04-13 07:10:32,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 07:10:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 441 transitions. [2018-04-13 07:10:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 07:10:32,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:32,712 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-13 07:10:32,713 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -278514865, now seen corresponding path program 1 times [2018-04-13 07:10:32,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:32,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:32,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:32,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:32,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:32,726 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:32,729 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:32,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:32,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:32,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:32,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:32,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:32,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:10:32,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 07:10:32,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2018-04-13 07:10:32,854 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-13 07:10:32,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 07:10:32,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,861 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-13 07:10:32,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-04-13 07:10:32,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:32,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:32,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:32,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2018-04-13 07:10:32,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:32,964 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-13 07:10:32,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:45 [2018-04-13 07:10:33,034 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 41 treesize of output 42 [2018-04-13 07:10:33,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 07:10:33,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,049 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-13 07:10:33,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-04-13 07:10:33,078 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 50 treesize of output 49 [2018-04-13 07:10:33,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:33,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, 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 33 [2018-04-13 07:10:33,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,100 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-13 07:10:33,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-04-13 07:10:33,126 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 55 treesize of output 47 [2018-04-13 07:10:33,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:33,128 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 8 [2018-04-13 07:10:33,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:33,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-13 07:10:33,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:33,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:33,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:78, output treesize:24 [2018-04-13 07:10:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 07:10:33,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:33,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 07:10:33,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 07:10:33,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 07:10:33,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-04-13 07:10:33,174 INFO L87 Difference]: Start difference. First operand 381 states and 441 transitions. Second operand 18 states. [2018-04-13 07:10:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:34,204 INFO L93 Difference]: Finished difference Result 430 states and 499 transitions. [2018-04-13 07:10:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 07:10:34,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-04-13 07:10:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:34,205 INFO L225 Difference]: With dead ends: 430 [2018-04-13 07:10:34,205 INFO L226 Difference]: Without dead ends: 430 [2018-04-13 07:10:34,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-04-13 07:10:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-13 07:10:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 385. [2018-04-13 07:10:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 07:10:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 443 transitions. [2018-04-13 07:10:34,211 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 443 transitions. Word has length 72 [2018-04-13 07:10:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:34,211 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 443 transitions. [2018-04-13 07:10:34,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 07:10:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 443 transitions. [2018-04-13 07:10:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 07:10:34,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:34,212 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-13 07:10:34,212 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash -278514864, now seen corresponding path program 1 times [2018-04-13 07:10:34,213 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:34,213 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:34,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:34,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:34,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:34,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:34,237 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:34,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:34,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:34,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:34,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:34,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, 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-13 07:10:34,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-04-13 07:10:34,415 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-13 07:10:34,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:34,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,435 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-13 07:10:34,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:34,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,459 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-13 07:10:34,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:54 [2018-04-13 07:10:34,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 35 [2018-04-13 07:10:34,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2018-04-13 07:10:34,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 07:10:34,564 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-13 07:10:34,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:63 [2018-04-13 07:10:34,678 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 57 treesize of output 58 [2018-04-13 07:10:34,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 07:10:34,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-13 07:10:34,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:34,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:34,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:81 [2018-04-13 07:10:34,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-13 07:10:34,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:34,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,802 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 66 treesize of output 65 [2018-04-13 07:10:34,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:34,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 42 [2018-04-13 07:10:34,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,829 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-13 07:10:34,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:99 [2018-04-13 07:10:34,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-13 07:10:34,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 07:10:34,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,872 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:34,873 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 33 treesize of output 25 [2018-04-13 07:10:34,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,893 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 65 treesize of output 55 [2018-04-13 07:10:34,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:34,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:34,895 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 16 [2018-04-13 07:10:34,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:34,903 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 26 treesize of output 18 [2018-04-13 07:10:34,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:34,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:34,914 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:117, output treesize:20 [2018-04-13 07:10:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 07:10:34,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:10:34,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 07:10:34,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 07:10:34,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 07:10:34,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-04-13 07:10:34,953 INFO L87 Difference]: Start difference. First operand 385 states and 443 transitions. Second operand 22 states. [2018-04-13 07:10:36,401 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 113 DAG size of output 86 [2018-04-13 07:10:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:10:36,761 INFO L93 Difference]: Finished difference Result 389 states and 448 transitions. [2018-04-13 07:10:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 07:10:36,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-04-13 07:10:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:10:36,762 INFO L225 Difference]: With dead ends: 389 [2018-04-13 07:10:36,762 INFO L226 Difference]: Without dead ends: 389 [2018-04-13 07:10:36,762 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=411, Invalid=1311, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 07:10:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-13 07:10:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2018-04-13 07:10:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 07:10:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 442 transitions. [2018-04-13 07:10:36,768 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 442 transitions. Word has length 72 [2018-04-13 07:10:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:10:36,768 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 442 transitions. [2018-04-13 07:10:36,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 07:10:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 442 transitions. [2018-04-13 07:10:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 07:10:36,769 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:10:36,769 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-04-13 07:10:36,769 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:10:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1905389954, now seen corresponding path program 1 times [2018-04-13 07:10:36,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:10:36,769 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:10:36,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:36,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:36,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:10:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:36,785 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:10:36,789 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:10:36,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:10:36,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:10:36,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:10:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:10:36,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:10:36,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:36,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:36,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 07:10:36,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:36,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 07:10:36,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:36,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:36,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 07:10:36,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-13 07:10:36,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 07:10:36,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 07:10:36,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:36,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,011 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-13 07:10:37,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 07:10:37,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-13 07:10:37,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, 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-13 07:10:37,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 07:10:37,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,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 21 treesize of output 16 [2018-04-13 07:10:37,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,106 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-13 07:10:37,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-04-13 07:10:37,729 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 94 DAG size of output 76 [2018-04-13 07:10:37,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 34 [2018-04-13 07:10:37,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,828 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 22 treesize of output 34 [2018-04-13 07:10:37,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,938 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 48 treesize of output 60 [2018-04-13 07:10:37,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-13 07:10:37,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 07:10:37,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:37,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:37,995 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 51 treesize of output 60 [2018-04-13 07:10:37,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2018-04-13 07:10:38,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:10:38,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,008 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,025 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,105 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 48 treesize of output 66 [2018-04-13 07:10:38,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 [2018-04-13 07:10:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,110 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-13 07:10:38,110 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,115 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,137 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 95 [2018-04-13 07:10:38,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2018-04-13 07:10:38,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:38,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-13 07:10:38,143 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,147 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,160 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:38,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:10:38,204 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:185, output treesize:213 [2018-04-13 07:10:51,465 WARN L151 SmtUtils]: Spent 2411ms on a formula simplification. DAG size of input: 142 DAG size of output 135 [2018-04-13 07:10:51,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:51,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:51,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:51,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:51,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:51,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:51,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2018-04-13 07:10:51,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:52,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:52,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:52,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:52,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 79 [2018-04-13 07:10:52,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:53,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,681 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-04-13 07:10:53,682 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 237 [2018-04-13 07:10:53,784 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-04-13 07:10:53,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 47 treesize of output 44 [2018-04-13 07:10:53,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,798 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 44 treesize of output 50 [2018-04-13 07:10:53,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:53,816 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:53,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:53,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,017 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 204 [2018-04-13 07:10:54,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,052 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 4 case distinctions, treesize of input 25 treesize of output 52 [2018-04-13 07:10:54,053 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-13 07:10:54,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 214 [2018-04-13 07:10:54,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:54,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 110 [2018-04-13 07:10:54,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:54,287 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:54,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 185 [2018-04-13 07:10:54,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:54,355 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2018-04-13 07:10:54,355 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:54,418 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:54,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:54,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:54,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,972 INFO L303 Elim1Store]: Index analysis took 264 ms [2018-04-13 07:10:54,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 230 [2018-04-13 07:10:54,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2018-04-13 07:10:54,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:54,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:10:54,994 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:55,014 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:55,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:55,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:55,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:55,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:55,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:55,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:55,446 INFO L303 Elim1Store]: Index analysis took 191 ms [2018-04-13 07:10:55,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 234 [2018-04-13 07:10:55,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 224 [2018-04-13 07:10:55,465 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:56,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,125 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:56,139 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 164 treesize of output 205 [2018-04-13 07:10:56,140 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:56,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,897 INFO L303 Elim1Store]: Index analysis took 152 ms [2018-04-13 07:10:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 204 [2018-04-13 07:10:56,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:56,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:56,918 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2018-04-13 07:10:56,919 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:57,028 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:57,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,582 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-04-13 07:10:57,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 197 [2018-04-13 07:10:57,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:57,600 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2018-04-13 07:10:57,600 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:57,694 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:57,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:57,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:58,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 175 [2018-04-13 07:10:58,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:58,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:58,038 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:58,045 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 110 treesize of output 95 [2018-04-13 07:10:58,046 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:58,116 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:58,283 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:58,552 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:10:59,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,172 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 0 case distinctions, treesize of input 282 treesize of output 290 [2018-04-13 07:10:59,316 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 103 DAG size of output 95 [2018-04-13 07:10:59,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 47 treesize of output 44 [2018-04-13 07:10:59,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,327 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 44 treesize of output 50 [2018-04-13 07:10:59,327 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,338 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,448 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 0 case distinctions, treesize of input 167 treesize of output 203 [2018-04-13 07:10:59,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 52 [2018-04-13 07:10:59,469 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-04-13 07:10:59,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,573 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 166 treesize of output 197 [2018-04-13 07:10:59,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,578 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:59,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-04-13 07:10:59,579 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,613 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,633 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 168 treesize of output 199 [2018-04-13 07:10:59,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:59,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-04-13 07:10:59,639 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,674 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,694 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 166 treesize of output 197 [2018-04-13 07:10:59,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,699 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:10:59,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-04-13 07:10:59,700 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,735 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:10:59,820 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 07:10:59,928 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 07:10:59,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:10:59,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 243 [2018-04-13 07:10:59,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2018-04-13 07:11:00,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:11:00,003 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,010 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,116 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 166 [2018-04-13 07:11:00,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-04-13 07:11:00,122 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,182 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 154 [2018-04-13 07:11:00,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:00,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 92 [2018-04-13 07:11:00,187 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,219 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,239 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,280 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,406 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-04-13 07:11:00,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 283 [2018-04-13 07:11:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-13 07:11:00,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:11:00,419 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,427 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 229 [2018-04-13 07:11:00,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 228 [2018-04-13 07:11:00,578 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:00,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:00,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:00,833 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 154 treesize of output 187 [2018-04-13 07:11:00,833 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 174 [2018-04-13 07:11:01,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,045 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:01,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 100 [2018-04-13 07:11:01,046 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,080 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 208 [2018-04-13 07:11:01,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,245 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:01,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 158 [2018-04-13 07:11:01,246 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,291 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 205 [2018-04-13 07:11:01,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:01,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 142 [2018-04-13 07:11:01,443 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,480 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,543 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:11:01,615 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 07:11:01,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,648 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 0 case distinctions, treesize of input 280 treesize of output 288 [2018-04-13 07:11:01,799 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 101 DAG size of output 93 [2018-04-13 07:11:01,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 47 treesize of output 44 [2018-04-13 07:11:01,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,808 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 44 treesize of output 50 [2018-04-13 07:11:01,808 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,819 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:01,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,942 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 0 case distinctions, treesize of input 157 treesize of output 193 [2018-04-13 07:11:01,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:01,947 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:01,951 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 25 treesize of output 42 [2018-04-13 07:11:01,952 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:02,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,069 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 151 treesize of output 184 [2018-04-13 07:11:02,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:02,115 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:11:02,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 142 [2018-04-13 07:11:02,116 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:02,194 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:02,215 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:02,267 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:11:02,270 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 07:11:02,270 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:02,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 4 xjuncts. [2018-04-13 07:11:02,545 INFO L202 ElimStorePlain]: Needed 62 recursive calls to eliminate 13 variables, input treesize:447, output treesize:1199 [2018-04-13 07:11:03,692 WARN L151 SmtUtils]: Spent 997ms on a formula simplification. DAG size of input: 257 DAG size of output 198 [2018-04-13 07:11:04,174 WARN L148 SmtUtils]: Spent 307ms on a formula simplification that was a NOOP. DAG size: 232 [2018-04-13 07:11:04,587 WARN L148 SmtUtils]: Spent 262ms on a formula simplification that was a NOOP. DAG size: 232 [2018-04-13 07:11:04,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 322 [2018-04-13 07:11:04,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:04,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:04,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 328 [2018-04-13 07:11:04,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 07:11:05,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 377 [2018-04-13 07:11:05,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:05,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 316 [2018-04-13 07:11:05,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:05,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:05,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 276 [2018-04-13 07:11:05,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:06,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:06,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:06,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:06,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:06,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:06,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:11:06,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 331 [2018-04-13 07:11:06,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 07:11:06,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 6 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-04-13 07:11:06,405 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 20 variables, input treesize:907, output treesize:1199 [2018-04-13 07:11:07,121 WARN L148 SmtUtils]: Spent 526ms on a formula simplification that was a NOOP. DAG size: 318 [2018-04-13 07:11:07,807 WARN L148 SmtUtils]: Spent 483ms on a formula simplification that was a NOOP. DAG size: 318 [2018-04-13 07:11:13,903 WARN L148 SmtUtils]: Spent 1030ms on a formula simplification that was a NOOP. DAG size: 346 [2018-04-13 07:11:25,229 WARN L151 SmtUtils]: Spent 3831ms on a formula simplification. DAG size of input: 1022 DAG size of output 349 [2018-04-13 07:11:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 07:11:25,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 07:11:25,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 07:11:25,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 07:11:25,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 07:11:25,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1028, Unknown=9, NotChecked=0, Total=1122 [2018-04-13 07:11:25,322 INFO L87 Difference]: Start difference. First operand 385 states and 442 transitions. Second operand 34 states. [2018-04-13 07:12:11,971 WARN L151 SmtUtils]: Spent 940ms on a formula simplification. DAG size of input: 217 DAG size of output 217 [2018-04-13 07:12:12,825 WARN L148 SmtUtils]: Spent 295ms on a formula simplification that was a NOOP. DAG size: 241 [2018-04-13 07:12:14,030 WARN L151 SmtUtils]: Spent 705ms on a formula simplification. DAG size of input: 326 DAG size of output 245 [2018-04-13 07:12:15,469 WARN L148 SmtUtils]: Spent 584ms on a formula simplification that was a NOOP. DAG size: 338 [2018-04-13 07:12:19,081 WARN L151 SmtUtils]: Spent 1236ms on a formula simplification. DAG size of input: 384 DAG size of output 341 [2018-04-13 07:12:22,773 WARN L151 SmtUtils]: Spent 1179ms on a formula simplification. DAG size of input: 387 DAG size of output 343 [2018-04-13 07:13:00,167 WARN L151 SmtUtils]: Spent 36971ms on a formula simplification. DAG size of input: 479 DAG size of output 461 [2018-04-13 07:13:42,541 WARN L151 SmtUtils]: Spent 41823ms on a formula simplification. DAG size of input: 573 DAG size of output 462 [2018-04-13 07:13:49,589 WARN L151 SmtUtils]: Spent 1189ms on a formula simplification. DAG size of input: 390 DAG size of output 346 [2018-04-13 07:14:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 07:14:52,267 INFO L93 Difference]: Finished difference Result 458 states and 537 transitions. [2018-04-13 07:14:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 07:14:52,268 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-04-13 07:14:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 07:14:52,269 INFO L225 Difference]: With dead ends: 458 [2018-04-13 07:14:52,269 INFO L226 Difference]: Without dead ends: 458 [2018-04-13 07:14:52,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 127.6s TimeCoverageRelationStatistics Valid=271, Invalid=2367, Unknown=14, NotChecked=0, Total=2652 [2018-04-13 07:14:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-13 07:14:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 404. [2018-04-13 07:14:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-04-13 07:14:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 468 transitions. [2018-04-13 07:14:52,276 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 468 transitions. Word has length 74 [2018-04-13 07:14:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 07:14:52,276 INFO L459 AbstractCegarLoop]: Abstraction has 404 states and 468 transitions. [2018-04-13 07:14:52,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 07:14:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 468 transitions. [2018-04-13 07:14:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-13 07:14:52,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 07:14:52,277 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 07:14:52,277 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-13 07:14:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash 937586753, now seen corresponding path program 2 times [2018-04-13 07:14:52,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 07:14:52,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 07:14:52,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:14:52,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 07:14:52,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 07:14:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 07:14:52,305 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 07:14:52,310 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 07:14:52,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 07:14:52,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 07:14:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 07:14:52,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 07:14:52,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 07:14:52,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 07:14:52,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 07:14:52,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 07:14:52,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:14:52,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:14:52,462 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-13 07:14:52,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,474 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-13 07:14:52,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-13 07:14:52,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 07:14:52,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 07:14:52,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 07:14:52,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 10 treesize of output 9 [2018-04-13 07:14:52,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:14:52,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-13 07:15:00,999 WARN L148 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 07:15:01,522 WARN L151 SmtUtils]: Spent 520ms on a formula simplification. DAG size of input: 84 DAG size of output 81 [2018-04-13 07:15:01,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,535 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 22 treesize of output 34 [2018-04-13 07:15:01,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:01,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-13 07:15:01,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:01,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,949 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 41 treesize of output 49 [2018-04-13 07:15:01,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-13 07:15:01,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 07:15:01,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:01,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:01,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:01,989 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 40 treesize of output 49 [2018-04-13 07:15:01,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 14 [2018-04-13 07:15:01,993 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 14 treesize of output 15 [2018-04-13 07:15:01,993 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:01,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,009 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,028 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 48 treesize of output 50 [2018-04-13 07:15:02,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-13 07:15:02,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,034 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 33 treesize of output 37 [2018-04-13 07:15:02,034 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,041 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-04-13 07:15:02,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 42 [2018-04-13 07:15:02,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 57 [2018-04-13 07:15:02,080 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,094 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,101 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,112 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,181 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 41 treesize of output 55 [2018-04-13 07:15:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-13 07:15:02,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,186 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-13 07:15:02,186 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,190 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,208 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 46 treesize of output 74 [2018-04-13 07:15:02,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-13 07:15:02,211 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 27 [2018-04-13 07:15:02,211 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,215 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,224 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,231 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-04-13 07:15:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-13 07:15:02,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,240 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 33 treesize of output 37 [2018-04-13 07:15:02,240 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,246 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-04-13 07:15:02,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2018-04-13 07:15:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:02,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 81 [2018-04-13 07:15:02,267 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,276 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,283 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,290 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:02,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 07:15:02,325 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 6 variables, input treesize:154, output treesize:144 [2018-04-13 07:15:19,606 WARN L151 SmtUtils]: Spent 1846ms on a formula simplification. DAG size of input: 135 DAG size of output 128 [2018-04-13 07:15:19,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:19,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:19,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:19,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:19,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:19,683 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 27 treesize of output 54 [2018-04-13 07:15:19,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:20,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:20,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:20,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:20,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:20,595 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-04-13 07:15:20,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 70 [2018-04-13 07:15:20,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 07:15:21,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:21,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:21,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:21,607 INFO L303 Elim1Store]: Index analysis took 180 ms [2018-04-13 07:15:21,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 177 [2018-04-13 07:15:21,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 173 treesize of output 175 [2018-04-13 07:15:21,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:21,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 07:15:21,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:21,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:23,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 141 [2018-04-13 07:15:23,359 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 07:15:23,360 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:23,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:23,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:23,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:23,941 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 129 treesize of output 152 [2018-04-13 07:15:23,941 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:24,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:24,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 142 [2018-04-13 07:15:24,543 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:25,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:25,140 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:25,153 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 129 treesize of output 136 [2018-04-13 07:15:25,153 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:25,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 07:15:28,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:28,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:28,232 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 145 [2018-04-13 07:15:28,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 141 [2018-04-13 07:15:28,237 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:29,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:29,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:29,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 132 [2018-04-13 07:15:29,071 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:29,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:29,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:29,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 124 [2018-04-13 07:15:29,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:29,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:29,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:29,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:29,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 65 [2018-04-13 07:15:29,905 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:30,019 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:30,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:30,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:30,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:30,671 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 3 case distinctions, treesize of input 121 treesize of output 142 [2018-04-13 07:15:30,676 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:30,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 141 [2018-04-13 07:15:30,676 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:30,821 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:31,089 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:31,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:31,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:31,172 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 147 [2018-04-13 07:15:31,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 143 [2018-04-13 07:15:31,178 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:32,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:32,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 134 [2018-04-13 07:15:32,044 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:32,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:32,943 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:32,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 126 [2018-04-13 07:15:32,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:32,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:32,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:32,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:32,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 65 [2018-04-13 07:15:32,974 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:33,113 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:33,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:33,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:33,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:33,802 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 3 case distinctions, treesize of input 123 treesize of output 136 [2018-04-13 07:15:33,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:33,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-04-13 07:15:33,807 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:33,910 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:34,181 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:34,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:34,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:34,258 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 138 [2018-04-13 07:15:34,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 134 [2018-04-13 07:15:34,264 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:35,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:35,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:35,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 125 [2018-04-13 07:15:35,089 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:35,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:35,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:35,887 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:35,888 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 128 [2018-04-13 07:15:35,892 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:35,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-04-13 07:15:35,892 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:35,985 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:36,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:36,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:36,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:36,531 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 3 case distinctions, treesize of input 117 treesize of output 128 [2018-04-13 07:15:36,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:36,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:36,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 84 [2018-04-13 07:15:36,538 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:36,629 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:36,974 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 07:15:38,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:38,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:38,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:38,727 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-04-13 07:15:38,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 170 [2018-04-13 07:15:38,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:38,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:38,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:38,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 139 treesize of output 238 [2018-04-13 07:15:38,871 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 07:15:38,871 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:41,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:41,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:41,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 215 [2018-04-13 07:15:41,365 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:45,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:45,986 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:45,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:45,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:45,999 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:46,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 181 [2018-04-13 07:15:46,008 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:50,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:50,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:50,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:50,432 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:50,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:50,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:50,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 185 [2018-04-13 07:15:50,459 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 07:15:54,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:54,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:54,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:54,781 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:54,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:15:54,788 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:15:54,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 183 [2018-04-13 07:15:54,802 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 07:16:00,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:00,874 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:00,886 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:00,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 153 treesize of output 186 [2018-04-13 07:16:00,935 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-04-13 07:16:02,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:02,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:02,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:02,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 230 [2018-04-13 07:16:02,901 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-13 07:16:14,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:14,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:14,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:14,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:14,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:14,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 183 [2018-04-13 07:16:14,470 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 07:16:19,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:19,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:19,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 213 [2018-04-13 07:16:19,590 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-13 07:16:21,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:21,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:21,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:21,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 228 [2018-04-13 07:16:21,353 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-13 07:16:30,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:16:30,464 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:30,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:16:30,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 151 treesize of output 184 [2018-04-13 07:16:30,526 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. [2018-04-13 07:16:32,509 INFO L267 ElimStorePlain]: Start of recursive call 34: 32 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-04-13 07:17:05,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:05,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 164 [2018-04-13 07:17:05,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:05,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:05,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:05,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:17:05,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 174 [2018-04-13 07:17:05,840 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-13 07:17:06,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:06,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:06,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:06,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:17:06,807 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 140 treesize of output 170 [2018-04-13 07:17:06,808 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 07:17:07,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:07,754 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:17:07,759 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 134 treesize of output 141 [2018-04-13 07:17:07,760 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-13 07:17:08,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:08,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:17:08,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 149 [2018-04-13 07:17:08,669 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-13 07:17:09,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:09,585 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:17:09,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 147 [2018-04-13 07:17:09,594 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-13 07:17:10,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:17:10,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 07:17:10,462 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 136 treesize of output 143 [2018-04-13 07:17:10,462 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-13 07:17:13,012 INFO L267 ElimStorePlain]: Start of recursive call 46: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-13 07:17:51,574 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 149 treesize of output 148 [2018-04-13 07:17:51,575 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-13 07:18:30,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:18:30,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 07:18:30,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 155 [2018-04-13 07:18:30,578 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-13 07:18:53,802 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-13 07:18:53,802 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 07:18:53,806 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 07:18:53,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:18:53 BoogieIcfgContainer [2018-04-13 07:18:53,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 07:18:53,807 INFO L168 Benchmark]: Toolchain (without parser) took 859468.02 ms. Allocated memory was 403.2 MB in the beginning and 568.3 MB in the end (delta: 165.2 MB). Free memory was 340.7 MB in the beginning and 479.6 MB in the end (delta: -138.9 MB). Peak memory consumption was 196.2 MB. Max. memory is 5.3 GB. [2018-04-13 07:18:53,807 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 07:18:53,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.95 ms. Allocated memory is still 403.2 MB. Free memory was 339.3 MB in the beginning and 314.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-13 07:18:53,808 INFO L168 Benchmark]: Boogie Preprocessor took 45.13 ms. Allocated memory is still 403.2 MB. Free memory was 314.2 MB in the beginning and 311.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 07:18:53,808 INFO L168 Benchmark]: RCFGBuilder took 502.53 ms. Allocated memory was 403.2 MB in the beginning and 590.3 MB in the end (delta: 187.2 MB). Free memory was 311.6 MB in the beginning and 508.7 MB in the end (delta: -197.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-13 07:18:53,808 INFO L168 Benchmark]: TraceAbstraction took 858659.17 ms. Allocated memory was 590.3 MB in the beginning and 568.3 MB in the end (delta: -22.0 MB). Free memory was 508.7 MB in the beginning and 479.6 MB in the end (delta: 29.1 MB). Peak memory consumption was 177.1 MB. Max. memory is 5.3 GB. [2018-04-13 07:18:53,809 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.2 MB. Free memory is still 366.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 257.95 ms. Allocated memory is still 403.2 MB. Free memory was 339.3 MB in the beginning and 314.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.13 ms. Allocated memory is still 403.2 MB. Free memory was 314.2 MB in the beginning and 311.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 502.53 ms. Allocated memory was 403.2 MB in the beginning and 590.3 MB in the end (delta: 187.2 MB). Free memory was 311.6 MB in the beginning and 508.7 MB in the end (delta: -197.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 858659.17 ms. Allocated memory was 590.3 MB in the beginning and 568.3 MB in the end (delta: -22.0 MB). Free memory was 508.7 MB in the beginning and 479.6 MB in the end (delta: 29.1 MB). Peak memory consumption was 177.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 365. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 145 locations, 55 error locations. TIMEOUT Result, 858.6s OverallTime, 30 OverallIterations, 3 TraceHistogramMax, 480.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2887 SDtfs, 5526 SDslu, 14190 SDs, 0 SdLazy, 16512 SolverSat, 812 SolverUnsat, 253 SolverUnknown, 0 SolverNotchecked, 236.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1402 GetRequests, 787 SyntacticMatches, 13 SemanticMatches, 602 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 332.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=29, 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, 29 MinimizatonAttempts, 964 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 134.4s InterpolantComputationTime, 2405 NumberOfCodeBlocks, 2405 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1320 ConstructedInterpolants, 415 QuantifiedInterpolants, 2982328 SizeOfPredicates, 321 NumberOfNonLiveVariables, 5523 ConjunctsInSsa, 959 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 210/412 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/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_07-18-53-815.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_07-18-53-815.csv Completed graceful shutdown