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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:13:14,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:13:14,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:13:14,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:13:14,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:13:14,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:13:14,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:13:14,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:13:14,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:13:14,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:13:14,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:13:14,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:13:14,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:13:14,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:13:14,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:13:14,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:13:14,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:13:14,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:13:14,886 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:13:14,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:13:14,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:13:14,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:13:14,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:13:14,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:13:14,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:13:14,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:13:14,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:13:14,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:13:14,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:13:14,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:13:14,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:13:14,892 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-10 14:13:14,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:13:14,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:13:14,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:13:14,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:13:14,907 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:13:14,908 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:13:14,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:13:14,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:13:14,909 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:13:14,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:13:14,909 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:13:14,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:13:14,942 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:13:14,945 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:13:14,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:13:14,946 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:13:14,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,269 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG38fe49bc1 [2018-04-10 14:13:15,402 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:13:15,402 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:13:15,403 INFO L168 CDTParser]: Scanning dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,410 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:13:15,410 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:13:15,410 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:13:15,410 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,410 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:13:15,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,410 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__register_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__timer_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__off_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____mode_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,411 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__id_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__gid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_short in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__uint in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__mode_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__SLL in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____clock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_short in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,412 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__dev_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__time_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_int in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____loff_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,413 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ino_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ushort in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,414 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____time_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__loff_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__ulong in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_long in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,415 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_char in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____off_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_long in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____dev_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fd_set in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,416 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__clock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____ino_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____int32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__div_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,417 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__uid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__key_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__size_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____gid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____id_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__int16_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____timer_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,418 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____pid_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____quad_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____u_char in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____off64_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,419 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_token_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:15,432 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG38fe49bc1 [2018-04-10 14:13:15,435 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:13:15,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:13:15,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:13:15,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:13:15,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:13:15,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355e2c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15, skipping insertion in model container [2018-04-10 14:13:15,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,453 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:13:15,481 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:13:15,627 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:13:15,665 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:13:15,670 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:13:15,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15 WrapperNode [2018-04-10 14:13:15,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:13:15,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:13:15,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:13:15,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:13:15,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (1/1) ... [2018-04-10 14:13:15,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:13:15,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:13:15,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:13:15,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:13:15,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (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-10 14:13:15,850 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:13:15,850 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:13:15,850 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:13:15,850 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:13:15,850 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:13:15,850 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:13:15,850 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:13:15,850 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:13:15,851 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:13:15,852 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:13:15,853 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:13:15,854 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:13:15,855 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:13:15,856 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:13:15,857 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:13:15,858 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:13:15,859 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:13:15,860 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:13:15,861 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:13:16,251 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:13:16,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:13:16 BoogieIcfgContainer [2018-04-10 14:13:16,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:13:16,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:13:16,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:13:16,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:13:16,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:13:15" (1/3) ... [2018-04-10 14:13:16,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a9940e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:13:16, skipping insertion in model container [2018-04-10 14:13:16,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:13:15" (2/3) ... [2018-04-10 14:13:16,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a9940e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:13:16, skipping insertion in model container [2018-04-10 14:13:16,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:13:16" (3/3) ... [2018-04-10 14:13:16,257 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:13:16,263 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:13:16,268 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-10 14:13:16,293 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:13:16,293 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:13:16,293 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:13:16,293 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:13:16,293 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:13:16,293 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:13:16,293 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:13:16,293 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:13:16,293 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:13:16,294 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:13:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-04-10 14:13:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:13:16,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:16,311 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:16,311 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1243505339, now seen corresponding path program 1 times [2018-04-10 14:13:16,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:16,315 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:16,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:16,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:16,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:16,412 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-10 14:13:16,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:16,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:13:16,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:13:16,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:13:16,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:13:16,426 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 4 states. [2018-04-10 14:13:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:16,586 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-04-10 14:13:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:13:16,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:13:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:16,596 INFO L225 Difference]: With dead ends: 162 [2018-04-10 14:13:16,596 INFO L226 Difference]: Without dead ends: 159 [2018-04-10 14:13:16,597 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-10 14:13:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-10 14:13:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 131. [2018-04-10 14:13:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 14:13:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-04-10 14:13:16,631 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 8 [2018-04-10 14:13:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:16,631 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-04-10 14:13:16,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:13:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-04-10 14:13:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:13:16,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:16,632 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:16,632 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1243505338, now seen corresponding path program 1 times [2018-04-10 14:13:16,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:16,632 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:16,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:16,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:16,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:16,682 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-10 14:13:16,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:16,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:13:16,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:13:16,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:13:16,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:13:16,684 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 4 states. [2018-04-10 14:13:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:16,812 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-04-10 14:13:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:13:16,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:13:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:16,814 INFO L225 Difference]: With dead ends: 156 [2018-04-10 14:13:16,814 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 14:13:16,814 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-10 14:13:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 14:13:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2018-04-10 14:13:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 14:13:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-04-10 14:13:16,822 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 8 [2018-04-10 14:13:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:16,822 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-04-10 14:13:16,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:13:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-04-10 14:13:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:13:16,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:16,823 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:16,823 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1332672851, now seen corresponding path program 1 times [2018-04-10 14:13:16,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:16,824 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:16,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:16,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:16,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:16,866 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-10 14:13:16,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:16,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:13:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:13:16,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:13:16,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:13:16,868 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 4 states. [2018-04-10 14:13:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:16,983 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-04-10 14:13:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:13:16,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 14:13:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:16,984 INFO L225 Difference]: With dead ends: 132 [2018-04-10 14:13:16,985 INFO L226 Difference]: Without dead ends: 132 [2018-04-10 14:13:16,985 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-10 14:13:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-10 14:13:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2018-04-10 14:13:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-10 14:13:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2018-04-10 14:13:16,990 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 15 [2018-04-10 14:13:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:16,990 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2018-04-10 14:13:16,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:13:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-04-10 14:13:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:13:16,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:16,991 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:16,991 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1332672852, now seen corresponding path program 1 times [2018-04-10 14:13:16,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:16,991 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:16,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:16,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:16,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:17,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:17,047 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-10 14:13:17,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:17,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:13:17,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:13:17,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:13:17,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:13:17,048 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 5 states. [2018-04-10 14:13:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:17,195 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-04-10 14:13:17,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:13:17,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-10 14:13:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:17,197 INFO L225 Difference]: With dead ends: 205 [2018-04-10 14:13:17,197 INFO L226 Difference]: Without dead ends: 205 [2018-04-10 14:13:17,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:13:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-10 14:13:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 158. [2018-04-10 14:13:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 14:13:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-10 14:13:17,205 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 15 [2018-04-10 14:13:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:17,205 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-10 14:13:17,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:13:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-10 14:13:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:13:17,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:17,206 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:17,206 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1020098763, now seen corresponding path program 1 times [2018-04-10 14:13:17,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:17,206 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:17,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:17,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:17,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:17,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:17,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:13:17,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:13:17,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:13:17,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:13:17,249 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 5 states. [2018-04-10 14:13:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:17,434 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-04-10 14:13:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:13:17,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:13:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:17,435 INFO L225 Difference]: With dead ends: 225 [2018-04-10 14:13:17,435 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 14:13:17,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:13:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 14:13:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 157. [2018-04-10 14:13:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 14:13:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-04-10 14:13:17,439 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 18 [2018-04-10 14:13:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:17,439 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-04-10 14:13:17,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:13:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-04-10 14:13:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:13:17,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:17,440 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:17,440 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1020098762, now seen corresponding path program 1 times [2018-04-10 14:13:17,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:17,440 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:17,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:17,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:17,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:17,486 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-10 14:13:17,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:17,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:13:17,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:13:17,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:13:17,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:13:17,487 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 5 states. [2018-04-10 14:13:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:17,657 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-04-10 14:13:17,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:13:17,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:13:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:17,658 INFO L225 Difference]: With dead ends: 255 [2018-04-10 14:13:17,659 INFO L226 Difference]: Without dead ends: 255 [2018-04-10 14:13:17,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:13:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-10 14:13:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 156. [2018-04-10 14:13:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-10 14:13:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-04-10 14:13:17,664 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 18 [2018-04-10 14:13:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:17,664 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-04-10 14:13:17,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:13:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-04-10 14:13:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 14:13:17,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:17,665 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:17,665 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1578271401, now seen corresponding path program 1 times [2018-04-10 14:13:17,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:17,665 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:17,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:17,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:17,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:17,704 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-10 14:13:17,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:17,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:13:17,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:13:17,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:13:17,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:13:17,705 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 5 states. [2018-04-10 14:13:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:17,787 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-04-10 14:13:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:13:17,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-10 14:13:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:17,788 INFO L225 Difference]: With dead ends: 159 [2018-04-10 14:13:17,788 INFO L226 Difference]: Without dead ends: 159 [2018-04-10 14:13:17,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:13:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-10 14:13:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-04-10 14:13:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-10 14:13:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2018-04-10 14:13:17,791 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 19 [2018-04-10 14:13:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:17,791 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2018-04-10 14:13:17,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:13:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2018-04-10 14:13:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 14:13:17,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:17,792 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:17,792 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1578271400, now seen corresponding path program 1 times [2018-04-10 14:13:17,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:17,792 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:17,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:17,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:17,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:17,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:17,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:13:17,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:13:17,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:13:17,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:13:17,840 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 5 states. [2018-04-10 14:13:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:17,990 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-04-10 14:13:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:13:17,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-10 14:13:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:17,991 INFO L225 Difference]: With dead ends: 154 [2018-04-10 14:13:17,992 INFO L226 Difference]: Without dead ends: 154 [2018-04-10 14:13:17,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:13:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-10 14:13:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-10 14:13:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-10 14:13:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-04-10 14:13:17,994 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 19 [2018-04-10 14:13:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:17,995 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-04-10 14:13:17,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:13:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-04-10 14:13:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:13:17,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:17,995 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:17,995 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1276271173, now seen corresponding path program 1 times [2018-04-10 14:13:17,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:17,995 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:17,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:17,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:17,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:18,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:18,108 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-10 14:13:18,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:18,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:13:18,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:13:18,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:13:18,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:13:18,110 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 9 states. [2018-04-10 14:13:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:18,305 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2018-04-10 14:13:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:13:18,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-10 14:13:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:18,306 INFO L225 Difference]: With dead ends: 155 [2018-04-10 14:13:18,307 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 14:13:18,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:13:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 14:13:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-04-10 14:13:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 14:13:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-04-10 14:13:18,309 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 22 [2018-04-10 14:13:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:18,309 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-04-10 14:13:18,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:13:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-04-10 14:13:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:13:18,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:18,310 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:18,310 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1276271172, now seen corresponding path program 1 times [2018-04-10 14:13:18,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:18,310 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:18,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:18,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:18,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:18,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:18,385 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-10 14:13:18,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:18,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:13:18,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:13:18,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:13:18,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:13:18,386 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 9 states. [2018-04-10 14:13:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:18,649 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-04-10 14:13:18,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:13:18,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-10 14:13:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:18,650 INFO L225 Difference]: With dead ends: 154 [2018-04-10 14:13:18,650 INFO L226 Difference]: Without dead ends: 154 [2018-04-10 14:13:18,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:13:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-10 14:13:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-04-10 14:13:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 14:13:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-04-10 14:13:18,653 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 22 [2018-04-10 14:13:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:18,654 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-04-10 14:13:18,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:13:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-04-10 14:13:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:13:18,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:18,655 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:18,655 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1266958903, now seen corresponding path program 1 times [2018-04-10 14:13:18,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:18,655 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:18,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:18,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:18,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:18,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:18,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-10 14:13:18,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:18,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:13:18,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:13:18,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:13:18,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:13:18,752 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 9 states. [2018-04-10 14:13:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:19,168 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-04-10 14:13:19,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:13:19,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-10 14:13:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:19,169 INFO L225 Difference]: With dead ends: 153 [2018-04-10 14:13:19,169 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 14:13:19,170 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:13:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 14:13:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-04-10 14:13:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-10 14:13:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-04-10 14:13:19,173 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 22 [2018-04-10 14:13:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:19,173 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-04-10 14:13:19,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:13:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-04-10 14:13:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:13:19,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:19,174 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:19,174 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1266958904, now seen corresponding path program 1 times [2018-04-10 14:13:19,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:19,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:19,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:19,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:19,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:19,292 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-10 14:13:19,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:19,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 14:13:19,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:13:19,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:13:19,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:13:19,293 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 10 states. [2018-04-10 14:13:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:19,597 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-04-10 14:13:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:13:19,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-10 14:13:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:19,598 INFO L225 Difference]: With dead ends: 148 [2018-04-10 14:13:19,598 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 14:13:19,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:13:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 14:13:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-04-10 14:13:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-10 14:13:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-04-10 14:13:19,600 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 22 [2018-04-10 14:13:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:19,600 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-04-10 14:13:19,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:13:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-04-10 14:13:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:13:19,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:19,601 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:19,601 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash 115539414, now seen corresponding path program 1 times [2018-04-10 14:13:19,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:19,601 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:19,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:19,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:19,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:19,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:19,691 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-10 14:13:19,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:19,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:13:19,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:13:19,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:13:19,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:13:19,692 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2018-04-10 14:13:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:19,953 INFO L93 Difference]: Finished difference Result 223 states and 230 transitions. [2018-04-10 14:13:19,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:13:19,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-10 14:13:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:19,954 INFO L225 Difference]: With dead ends: 223 [2018-04-10 14:13:19,954 INFO L226 Difference]: Without dead ends: 223 [2018-04-10 14:13:19,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:13:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-10 14:13:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2018-04-10 14:13:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 14:13:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-04-10 14:13:19,956 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 37 [2018-04-10 14:13:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:19,956 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-04-10 14:13:19,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:13:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-04-10 14:13:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:13:19,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:19,957 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:19,957 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 115539415, now seen corresponding path program 1 times [2018-04-10 14:13:19,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:19,957 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:19,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:19,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:19,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:20,117 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-10 14:13:20,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:20,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-10 14:13:20,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:13:20,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:13:20,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:13:20,118 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 13 states. [2018-04-10 14:13:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:20,561 INFO L93 Difference]: Finished difference Result 255 states and 262 transitions. [2018-04-10 14:13:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:13:20,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-04-10 14:13:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:20,562 INFO L225 Difference]: With dead ends: 255 [2018-04-10 14:13:20,562 INFO L226 Difference]: Without dead ends: 255 [2018-04-10 14:13:20,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:13:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-10 14:13:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 153. [2018-04-10 14:13:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 14:13:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-04-10 14:13:20,566 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 37 [2018-04-10 14:13:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:20,566 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-04-10 14:13:20,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:13:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-04-10 14:13:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:13:20,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:20,567 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:20,567 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1992808857, now seen corresponding path program 1 times [2018-04-10 14:13:20,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:20,568 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:20,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:20,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:20,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:20,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:20,626 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:20,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:20,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:20,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:13:20,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:13:20,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:20,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:20,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:20,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:13:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:20,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:20,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-04-10 14:13:20,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:13:20,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:13:20,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:13:20,766 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 8 states. [2018-04-10 14:13:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:21,058 INFO L93 Difference]: Finished difference Result 225 states and 232 transitions. [2018-04-10 14:13:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:13:21,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-10 14:13:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:21,059 INFO L225 Difference]: With dead ends: 225 [2018-04-10 14:13:21,060 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 14:13:21,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:13:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 14:13:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 161. [2018-04-10 14:13:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 14:13:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2018-04-10 14:13:21,062 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 37 [2018-04-10 14:13:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:21,062 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2018-04-10 14:13:21,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:13:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2018-04-10 14:13:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:13:21,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:21,063 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:21,063 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1992808858, now seen corresponding path program 1 times [2018-04-10 14:13:21,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:21,064 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:21,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:21,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:21,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:21,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:21,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:21,307 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:21,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:21,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:13:21,433 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 19 treesize of output 11 [2018-04-10 14:13:21,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:21,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:21,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:13:21,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:13:21,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:21,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:21,448 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-10 14:13:21,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:13:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:21,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:21,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 20 [2018-04-10 14:13:21,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:13:21,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:13:21,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:13:21,502 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 21 states. [2018-04-10 14:13:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:22,326 INFO L93 Difference]: Finished difference Result 265 states and 272 transitions. [2018-04-10 14:13:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:13:22,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-04-10 14:13:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:22,327 INFO L225 Difference]: With dead ends: 265 [2018-04-10 14:13:22,327 INFO L226 Difference]: Without dead ends: 265 [2018-04-10 14:13:22,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 14:13:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-10 14:13:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 156. [2018-04-10 14:13:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-10 14:13:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2018-04-10 14:13:22,332 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 37 [2018-04-10 14:13:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:22,332 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2018-04-10 14:13:22,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:13:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2018-04-10 14:13:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 14:13:22,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:22,333 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:22,333 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1936110914, now seen corresponding path program 1 times [2018-04-10 14:13:22,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:22,334 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:22,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:22,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:22,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:22,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:22,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 14:13:22,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:13:22,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:13:22,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:13:22,554 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 16 states. [2018-04-10 14:13:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:22,894 INFO L93 Difference]: Finished difference Result 217 states and 222 transitions. [2018-04-10 14:13:22,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:13:22,894 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-04-10 14:13:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:22,895 INFO L225 Difference]: With dead ends: 217 [2018-04-10 14:13:22,895 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 14:13:22,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:13:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 14:13:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2018-04-10 14:13:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 14:13:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-04-10 14:13:22,897 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 46 [2018-04-10 14:13:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:22,898 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-04-10 14:13:22,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:13:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-04-10 14:13:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 14:13:22,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:22,898 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:22,898 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -700426646, now seen corresponding path program 1 times [2018-04-10 14:13:22,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:22,899 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:22,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:22,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:22,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:22,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:22,989 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-10 14:13:22,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:22,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 14:13:22,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:13:22,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:13:22,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:13:22,990 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 11 states. [2018-04-10 14:13:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:23,265 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2018-04-10 14:13:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:13:23,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-04-10 14:13:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:23,265 INFO L225 Difference]: With dead ends: 216 [2018-04-10 14:13:23,266 INFO L226 Difference]: Without dead ends: 216 [2018-04-10 14:13:23,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:13:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-10 14:13:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 162. [2018-04-10 14:13:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-10 14:13:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2018-04-10 14:13:23,269 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 49 [2018-04-10 14:13:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:23,269 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2018-04-10 14:13:23,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:13:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2018-04-10 14:13:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:13:23,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:23,270 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:23,270 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -238389276, now seen corresponding path program 1 times [2018-04-10 14:13:23,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:23,270 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:23,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:23,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:23,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:23,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:23,325 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-10 14:13:23,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:23,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:13:23,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:13:23,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:13:23,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:13:23,326 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand 8 states. [2018-04-10 14:13:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:23,494 INFO L93 Difference]: Finished difference Result 203 states and 209 transitions. [2018-04-10 14:13:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:13:23,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-10 14:13:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:23,495 INFO L225 Difference]: With dead ends: 203 [2018-04-10 14:13:23,495 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 14:13:23,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:13:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 14:13:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 178. [2018-04-10 14:13:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-10 14:13:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2018-04-10 14:13:23,499 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 50 [2018-04-10 14:13:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:23,499 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2018-04-10 14:13:23,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:13:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2018-04-10 14:13:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:13:23,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:23,500 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:23,500 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash -947725780, now seen corresponding path program 1 times [2018-04-10 14:13:23,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:23,500 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:23,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:23,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:23,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:23,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:23,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:23,689 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:23,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:23,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:23,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:23,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:23,758 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-10 14:13:23,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:13:23,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:13:23,781 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-10 14:13:23,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-10 14:13:23,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-10 14:13:23,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:23,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:23,830 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-10 14:13:23,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-10 14:13:24,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 14:13:24,049 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-10 14:13:24,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:24,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 14:13:24,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:24,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:24,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:24,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:10 [2018-04-10 14:13:24,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:24,070 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-10 14:13:24,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:24,074 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-10 14:13:24,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-10 14:13:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:24,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:24,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 23 [2018-04-10 14:13:24,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:13:24,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:13:24,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:13:24,129 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand 24 states. [2018-04-10 14:13:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:24,751 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2018-04-10 14:13:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:13:24,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-04-10 14:13:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:24,752 INFO L225 Difference]: With dead ends: 236 [2018-04-10 14:13:24,752 INFO L226 Difference]: Without dead ends: 236 [2018-04-10 14:13:24,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:13:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-10 14:13:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 185. [2018-04-10 14:13:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 14:13:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-04-10 14:13:24,755 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 50 [2018-04-10 14:13:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:24,755 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-04-10 14:13:24,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:13:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-04-10 14:13:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:13:24,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:24,755 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:24,755 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash -947725779, now seen corresponding path program 1 times [2018-04-10 14:13:24,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:24,756 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:24,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:24,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:24,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:24,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:24,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:24,948 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:24,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:24,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:25,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:13:25,145 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 19 treesize of output 11 [2018-04-10 14:13:25,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:25,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:25,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:13:25,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:13:25,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:25,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:25,165 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-10 14:13:25,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:13:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:25,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:25,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2018-04-10 14:13:25,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:13:25,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:13:25,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:13:25,243 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 26 states. [2018-04-10 14:13:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:26,175 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2018-04-10 14:13:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:13:26,175 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-04-10 14:13:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:26,176 INFO L225 Difference]: With dead ends: 232 [2018-04-10 14:13:26,176 INFO L226 Difference]: Without dead ends: 232 [2018-04-10 14:13:26,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=429, Invalid=1923, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 14:13:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-10 14:13:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 192. [2018-04-10 14:13:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-10 14:13:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-04-10 14:13:26,178 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 50 [2018-04-10 14:13:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:26,178 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-04-10 14:13:26,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:13:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-04-10 14:13:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:13:26,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:26,179 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:26,179 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:26,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1314925652, now seen corresponding path program 1 times [2018-04-10 14:13:26,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:26,179 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:26,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:26,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:26,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:26,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:26,375 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:26,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:26,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:26,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:26,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:26,403 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-10 14:13:26,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:13:26,412 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-10 14:13:26,414 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-10 14:13:26,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 14:13:26,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-10 14:13:26,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 14 treesize of output 13 [2018-04-10 14:13:26,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,463 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-10 14:13:26,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-10 14:13:26,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:26,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:26,544 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-10 14:13:26,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,548 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-10 14:13:26,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2018-04-10 14:13:26,571 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 40 treesize of output 35 [2018-04-10 14:13:26,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:13:26,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:26,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:26,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:26,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:60 [2018-04-10 14:13:26,669 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 3 case distinctions, treesize of input 63 treesize of output 67 [2018-04-10 14:13:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-04-10 14:13:26,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:26,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:51 [2018-04-10 14:13:26,750 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 1 case distinctions, treesize of input 58 treesize of output 47 [2018-04-10 14:13:26,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-04-10 14:13:26,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2018-04-10 14:13:26,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-10 14:13:26,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:26,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:58, output treesize:5 [2018-04-10 14:13:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:26,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:26,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 23 [2018-04-10 14:13:26,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:13:26,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:13:26,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:13:26,818 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 24 states. [2018-04-10 14:13:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:27,620 INFO L93 Difference]: Finished difference Result 331 states and 350 transitions. [2018-04-10 14:13:27,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:13:27,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-04-10 14:13:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:27,621 INFO L225 Difference]: With dead ends: 331 [2018-04-10 14:13:27,621 INFO L226 Difference]: Without dead ends: 331 [2018-04-10 14:13:27,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=1644, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:13:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-10 14:13:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 229. [2018-04-10 14:13:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 14:13:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 245 transitions. [2018-04-10 14:13:27,626 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 245 transitions. Word has length 51 [2018-04-10 14:13:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:27,626 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 245 transitions. [2018-04-10 14:13:27,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:13:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 245 transitions. [2018-04-10 14:13:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:13:27,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:27,637 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:27,637 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1314925651, now seen corresponding path program 1 times [2018-04-10 14:13:27,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:27,638 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:27,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:27,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:27,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:27,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:27,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:27,887 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:27,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:27,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:27,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:27,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:27,919 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-10 14:13:27,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:13:27,940 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-10 14:13:27,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, 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-10 14:13:27,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,948 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-10 14:13:27,950 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-10 14:13:27,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:13:27,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-10 14:13:27,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:27,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:27,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:13:28,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:28,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,022 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-10 14:13:28,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:13:28,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:28,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:28,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-10 14:13:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,132 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 14 treesize of output 21 [2018-04-10 14:13:28,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,140 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-10 14:13:28,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:69 [2018-04-10 14:13:28,173 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 56 treesize of output 51 [2018-04-10 14:13:28,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:13:28,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:28,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:28,221 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 62 treesize of output 61 [2018-04-10 14:13:28,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-10 14:13:28,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 71 [2018-04-10 14:13:28,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:28,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:13:28,241 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:28,276 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:94, output treesize:145 [2018-04-10 14:13:28,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 98 [2018-04-10 14:13:28,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:13:28,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,378 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 37 treesize of output 38 [2018-04-10 14:13:28,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:13:28,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,393 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-10 14:13:28,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:109 [2018-04-10 14:13:28,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 67 [2018-04-10 14:13:28,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-10 14:13:28,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-10 14:13:28,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:28,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-10 14:13:28,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:28,512 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 24 treesize of output 22 [2018-04-10 14:13:28,514 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-10 14:13:28,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:13:28,518 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:28,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:28,525 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:123, output treesize:18 [2018-04-10 14:13:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:28,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:28,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-04-10 14:13:28,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:13:28,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:13:28,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:13:28,609 INFO L87 Difference]: Start difference. First operand 229 states and 245 transitions. Second operand 32 states. [2018-04-10 14:13:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:30,264 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2018-04-10 14:13:30,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:13:30,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2018-04-10 14:13:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:30,265 INFO L225 Difference]: With dead ends: 349 [2018-04-10 14:13:30,265 INFO L226 Difference]: Without dead ends: 349 [2018-04-10 14:13:30,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=2387, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 14:13:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-10 14:13:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 229. [2018-04-10 14:13:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 14:13:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2018-04-10 14:13:30,268 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 51 [2018-04-10 14:13:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:30,268 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2018-04-10 14:13:30,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:13:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2018-04-10 14:13:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:13:30,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:30,268 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:30,269 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 562343791, now seen corresponding path program 1 times [2018-04-10 14:13:30,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:30,269 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:30,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:30,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:30,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:30,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:30,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:30,513 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:30,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:30,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:30,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:30,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:30,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:13:30,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:13:30,568 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-10 14:13:30,569 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-10 14:13:30,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 14:13:30,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-10 14:13:30,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:30,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,609 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-10 14:13:30,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-10 14:13:30,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:30,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:30,684 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-10 14:13:30,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,690 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-10 14:13:30,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2018-04-10 14:13:30,722 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 40 treesize of output 35 [2018-04-10 14:13:30,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:13:30,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:30,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:30,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:30,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:60 [2018-04-10 14:13:30,833 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 3 case distinctions, treesize of input 63 treesize of output 67 [2018-04-10 14:13:30,849 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 68 treesize of output 67 [2018-04-10 14:13:30,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:30,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:51 [2018-04-10 14:13:30,924 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 1 case distinctions, treesize of input 58 treesize of output 47 [2018-04-10 14:13:30,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-04-10 14:13:30,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-10 14:13:30,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-10 14:13:30,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-10 14:13:30,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:30,969 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:5 [2018-04-10 14:13:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:31,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:31,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 26 [2018-04-10 14:13:31,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 14:13:31,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 14:13:31,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-04-10 14:13:31,001 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand 27 states. [2018-04-10 14:13:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:32,070 INFO L93 Difference]: Finished difference Result 333 states and 352 transitions. [2018-04-10 14:13:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:13:32,070 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-04-10 14:13:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:32,071 INFO L225 Difference]: With dead ends: 333 [2018-04-10 14:13:32,071 INFO L226 Difference]: Without dead ends: 333 [2018-04-10 14:13:32,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=425, Invalid=2227, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:13:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-10 14:13:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 237. [2018-04-10 14:13:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-10 14:13:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 253 transitions. [2018-04-10 14:13:32,074 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 253 transitions. Word has length 51 [2018-04-10 14:13:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:32,074 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 253 transitions. [2018-04-10 14:13:32,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 14:13:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 253 transitions. [2018-04-10 14:13:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 14:13:32,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:32,074 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:32,074 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 562343792, now seen corresponding path program 1 times [2018-04-10 14:13:32,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:32,075 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:32,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:32,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:32,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:32,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:32,311 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:32,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:32,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:32,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:13:32,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:13:32,354 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-10 14:13:32,355 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-10 14:13:32,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,364 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-10 14:13:32,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:13:32,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:13:32,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:13:32,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:32,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 14:13:32,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:32,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,435 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-10 14:13:32,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:13:32,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,547 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-10 14:13:32,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,562 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 14 treesize of output 21 [2018-04-10 14:13:32,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,572 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-10 14:13:32,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:69 [2018-04-10 14:13:32,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:13:32,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:13:32,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:32,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:32,654 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 74 treesize of output 69 [2018-04-10 14:13:32,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:13:32,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:32,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:32,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:32,677 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 66 treesize of output 67 [2018-04-10 14:13:32,679 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 22 treesize of output 17 [2018-04-10 14:13:32,679 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,686 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:32,714 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:94, output treesize:139 [2018-04-10 14:13:32,787 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 37 treesize of output 38 [2018-04-10 14:13:32,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:13:32,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 90 [2018-04-10 14:13:32,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:13:32,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,825 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-10 14:13:32,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:109 [2018-04-10 14:13:32,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 67 [2018-04-10 14:13:32,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-10 14:13:32,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-10 14:13:32,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:32,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-10 14:13:32,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:32,938 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 24 treesize of output 22 [2018-04-10 14:13:32,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:13:32,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,944 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-10 14:13:32,944 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,945 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:32,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:32,952 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:123, output treesize:18 [2018-04-10 14:13:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:33,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:33,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-04-10 14:13:33,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 14:13:33,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 14:13:33,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:13:33,044 INFO L87 Difference]: Start difference. First operand 237 states and 253 transitions. Second operand 34 states. [2018-04-10 14:13:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:34,916 INFO L93 Difference]: Finished difference Result 364 states and 382 transitions. [2018-04-10 14:13:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:13:34,916 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2018-04-10 14:13:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:34,917 INFO L225 Difference]: With dead ends: 364 [2018-04-10 14:13:34,917 INFO L226 Difference]: Without dead ends: 364 [2018-04-10 14:13:34,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=458, Invalid=2964, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 14:13:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-10 14:13:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 243. [2018-04-10 14:13:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 14:13:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 259 transitions. [2018-04-10 14:13:34,920 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 259 transitions. Word has length 51 [2018-04-10 14:13:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:34,920 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 259 transitions. [2018-04-10 14:13:34,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 14:13:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 259 transitions. [2018-04-10 14:13:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:13:34,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:34,920 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:34,920 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:34,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1765591609, now seen corresponding path program 1 times [2018-04-10 14:13:34,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:34,921 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:34,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:34,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:34,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:34,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:35,058 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-10 14:13:35,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:35,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 14:13:35,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:13:35,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:13:35,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:13:35,059 INFO L87 Difference]: Start difference. First operand 243 states and 259 transitions. Second operand 12 states. [2018-04-10 14:13:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:35,321 INFO L93 Difference]: Finished difference Result 257 states and 271 transitions. [2018-04-10 14:13:35,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:13:35,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-10 14:13:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:35,322 INFO L225 Difference]: With dead ends: 257 [2018-04-10 14:13:35,322 INFO L226 Difference]: Without dead ends: 257 [2018-04-10 14:13:35,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:13:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-10 14:13:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2018-04-10 14:13:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:13:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-04-10 14:13:35,325 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 54 [2018-04-10 14:13:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:35,325 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-04-10 14:13:35,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:13:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-04-10 14:13:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:13:35,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:35,326 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:35,326 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash 960641837, now seen corresponding path program 1 times [2018-04-10 14:13:35,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:35,327 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:35,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:35,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:35,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:35,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:35,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:35,451 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:35,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:35,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:35,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:35,496 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-10 14:13:35,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:13:35,504 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-10 14:13:35,505 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-10 14:13:35,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,511 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-10 14:13:35,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:13:35,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:13:35,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 14:13:35,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:13:35,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2018-04-10 14:13:35,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 14:13:35,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:13:35,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:35,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:21 [2018-04-10 14:13:35,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-10 14:13:35,621 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 19 treesize of output 3 [2018-04-10 14:13:35,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:35,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 [2018-04-10 14:13:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:35,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:35,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-04-10 14:13:35,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:13:35,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:13:35,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:13:35,684 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 18 states. [2018-04-10 14:13:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:36,236 INFO L93 Difference]: Finished difference Result 281 states and 292 transitions. [2018-04-10 14:13:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:13:36,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-04-10 14:13:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:36,237 INFO L225 Difference]: With dead ends: 281 [2018-04-10 14:13:36,237 INFO L226 Difference]: Without dead ends: 281 [2018-04-10 14:13:36,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:13:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-10 14:13:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 239. [2018-04-10 14:13:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-04-10 14:13:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2018-04-10 14:13:36,239 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 54 [2018-04-10 14:13:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:36,240 INFO L459 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2018-04-10 14:13:36,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:13:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2018-04-10 14:13:36,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 14:13:36,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:36,240 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:36,240 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1725125489, now seen corresponding path program 1 times [2018-04-10 14:13:36,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:36,240 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:36,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:36,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:36,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:36,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:36,474 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-10 14:13:36,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:36,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-10 14:13:36,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:13:36,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:13:36,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:13:36,475 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 14 states. [2018-04-10 14:13:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:36,800 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions. [2018-04-10 14:13:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:13:36,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-10 14:13:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:36,801 INFO L225 Difference]: With dead ends: 255 [2018-04-10 14:13:36,801 INFO L226 Difference]: Without dead ends: 241 [2018-04-10 14:13:36,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:13:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-10 14:13:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 228. [2018-04-10 14:13:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 14:13:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 242 transitions. [2018-04-10 14:13:36,804 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 242 transitions. Word has length 57 [2018-04-10 14:13:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:36,804 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 242 transitions. [2018-04-10 14:13:36,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:13:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 242 transitions. [2018-04-10 14:13:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 14:13:36,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:36,804 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:36,804 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash -248481340, now seen corresponding path program 1 times [2018-04-10 14:13:36,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:36,805 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:36,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:36,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:36,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:36,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:37,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:13:37,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-10 14:13:37,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:13:37,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:13:37,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:13:37,038 INFO L87 Difference]: Start difference. First operand 228 states and 242 transitions. Second operand 15 states. [2018-04-10 14:13:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:37,304 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-04-10 14:13:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:13:37,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-04-10 14:13:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:37,305 INFO L225 Difference]: With dead ends: 233 [2018-04-10 14:13:37,305 INFO L226 Difference]: Without dead ends: 204 [2018-04-10 14:13:37,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:13:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-10 14:13:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2018-04-10 14:13:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 14:13:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2018-04-10 14:13:37,308 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 57 [2018-04-10 14:13:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:37,309 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2018-04-10 14:13:37,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:13:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2018-04-10 14:13:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:13:37,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:37,309 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:37,310 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1823346732, now seen corresponding path program 1 times [2018-04-10 14:13:37,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:37,310 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:37,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:37,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:37,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:37,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:37,662 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:37,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:37,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:37,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:37,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:37,708 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-10 14:13:37,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:13:37,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:13:37,739 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-10 14:13:37,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,746 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-10 14:13:37,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:13:37,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:13:37,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:13:37,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:37,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:13:37,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:37,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,819 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-10 14:13:37,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:13:37,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:37,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:37,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:37,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:37,935 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 42 [2018-04-10 14:13:37,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:37,950 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-10 14:13:37,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:79 [2018-04-10 14:13:37,990 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 54 treesize of output 49 [2018-04-10 14:13:37,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:13:37,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:38,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:38,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 92 [2018-04-10 14:13:38,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:38,039 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 41 [2018-04-10 14:13:38,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-10 14:13:38,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:38,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:13:38,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,065 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:38,090 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:101, output treesize:207 [2018-04-10 14:13:38,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 124 [2018-04-10 14:13:38,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:13:38,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,206 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 127 treesize of output 115 [2018-04-10 14:13:38,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:13:38,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,223 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-10 14:13:38,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:165, output treesize:133 [2018-04-10 14:13:38,314 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 118 treesize of output 103 [2018-04-10 14:13:38,315 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 90 treesize of output 93 [2018-04-10 14:13:38,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,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 93 treesize of output 66 [2018-04-10 14:13:38,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,339 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-10 14:13:38,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:147, output treesize:95 [2018-04-10 14:13:38,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 54 [2018-04-10 14:13:38,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:13:38,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:13:38,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:38,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 14:13:38,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:38,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:38,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:38,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-04-10 14:13:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:38,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:38,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2018-04-10 14:13:38,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 14:13:38,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 14:13:38,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:13:38,523 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand 38 states. [2018-04-10 14:13:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:40,138 INFO L93 Difference]: Finished difference Result 287 states and 303 transitions. [2018-04-10 14:13:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:13:40,138 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 60 [2018-04-10 14:13:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:40,139 INFO L225 Difference]: With dead ends: 287 [2018-04-10 14:13:40,139 INFO L226 Difference]: Without dead ends: 287 [2018-04-10 14:13:40,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=513, Invalid=3269, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:13:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-10 14:13:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 197. [2018-04-10 14:13:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 14:13:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2018-04-10 14:13:40,142 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 60 [2018-04-10 14:13:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:40,143 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2018-04-10 14:13:40,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 14:13:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2018-04-10 14:13:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:13:40,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:40,144 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:40,144 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1823346733, now seen corresponding path program 1 times [2018-04-10 14:13:40,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:40,144 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:40,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:40,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:40,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:40,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:40,505 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:40,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:40,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:13:40,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:40,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:36 [2018-04-10 14:13:40,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:40,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:40,682 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-10 14:13:40,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,689 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-10 14:13:40,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-04-10 14:13:40,747 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 32 treesize of output 42 [2018-04-10 14:13:40,750 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 33 treesize of output 36 [2018-04-10 14:13:40,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:40,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-04-10 14:13:40,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:40,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:40,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 72 [2018-04-10 14:13:40,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 59 treesize of output 62 [2018-04-10 14:13:40,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-04-10 14:13:40,859 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 28 treesize of output 18 [2018-04-10 14:13:40,860 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,864 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:40,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:40,879 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:65, output treesize:99 [2018-04-10 14:13:40,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:40,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2018-04-10 14:13:40,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:40,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 82 [2018-04-10 14:13:41,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:41,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 94 [2018-04-10 14:13:41,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 89 [2018-04-10 14:13:41,100 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,147 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 70 treesize of output 63 [2018-04-10 14:13:41,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:41,149 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,156 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:41,174 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:180, output treesize:144 [2018-04-10 14:13:41,308 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 208 treesize of output 240 [2018-04-10 14:13:41,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 213 treesize of output 212 [2018-04-10 14:13:41,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:41,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 243 [2018-04-10 14:13:41,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:41,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:41,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 98 [2018-04-10 14:13:41,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:13:41,466 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,475 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 14:13:41,520 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:314, output treesize:490 [2018-04-10 14:13:41,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 139 [2018-04-10 14:13:41,791 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-10 14:13:41,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,801 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 19 treesize of output 1 [2018-04-10 14:13:41,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2018-04-10 14:13:41,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:13:41,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,863 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-10 14:13:41,863 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:41,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 215 [2018-04-10 14:13:41,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:41,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:41,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 206 [2018-04-10 14:13:41,934 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-10 14:13:42,054 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 199 treesize of output 180 [2018-04-10 14:13:42,054 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:42,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 178 [2018-04-10 14:13:42,191 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:42,298 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 199 treesize of output 180 [2018-04-10 14:13:42,298 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:42,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 173 [2018-04-10 14:13:42,405 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:42,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 162 [2018-04-10 14:13:42,505 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:42,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:42,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:42,588 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 179 treesize of output 173 [2018-04-10 14:13:42,588 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:42,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 166 [2018-04-10 14:13:42,662 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:42,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:42,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:13:42,746 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:463, output treesize:330 [2018-04-10 14:13:42,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 131 [2018-04-10 14:13:43,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 89 [2018-04-10 14:13:43,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-04-10 14:13:43,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-04-10 14:13:43,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:43,129 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 116 treesize of output 107 [2018-04-10 14:13:43,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,169 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 74 [2018-04-10 14:13:43,170 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:43,219 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 91 [2018-04-10 14:13:43,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-10 14:13:43,281 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 1 case distinctions, treesize of input 116 treesize of output 90 [2018-04-10 14:13:43,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:43,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-04-10 14:13:43,336 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:43,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-10 14:13:43,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-04-10 14:13:43,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-04-10 14:13:43,433 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,444 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2018-04-10 14:13:43,444 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:43,450 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 81 [2018-04-10 14:13:43,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:43,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2018-04-10 14:13:43,464 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,495 INFO L267 ElimStorePlain]: Start of recursive call 14: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,500 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 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-10 14:13:43,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2018-04-10 14:13:43,506 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:43,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2018-04-10 14:13:43,530 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-04-10 14:13:43,554 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-10 14:13:43,575 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,597 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 31 treesize of output 24 [2018-04-10 14:13:43,598 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 14:13:43,599 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,607 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 73 [2018-04-10 14:13:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:43,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:43,619 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 61 treesize of output 51 [2018-04-10 14:13:43,619 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,662 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 61 treesize of output 52 [2018-04-10 14:13:43,662 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-04-10 14:13:43,701 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 45 [2018-04-10 14:13:43,738 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 14:13:43,788 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:43,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:43,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2018-04-10 14:13:43,825 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,839 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,845 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 1 case distinctions, treesize of input 83 treesize of output 71 [2018-04-10 14:13:43,847 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 63 treesize of output 39 [2018-04-10 14:13:43,848 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 14:13:43,867 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,886 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:43,893 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-10 14:13:43,893 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 4 variables, input treesize:169, output treesize:18 [2018-04-10 14:13:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:44,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:44,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-10 14:13:44,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:13:44,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:13:44,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:13:44,015 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand 42 states. [2018-04-10 14:13:50,952 WARN L151 SmtUtils]: Spent 6074ms on a formula simplification. DAG size of input: 120 DAG size of output 64 [2018-04-10 14:13:51,364 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 141 DAG size of output 91 [2018-04-10 14:13:51,566 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 145 DAG size of output 94 [2018-04-10 14:13:51,875 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 172 DAG size of output 121 [2018-04-10 14:13:52,014 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 79 DAG size of output 79 [2018-04-10 14:13:52,178 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 109 DAG size of output 109 [2018-04-10 14:13:52,332 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 86 DAG size of output 86 [2018-04-10 14:13:52,537 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 114 DAG size of output 112 [2018-04-10 14:13:52,719 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 140 DAG size of output 83 [2018-04-10 14:13:52,944 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 144 DAG size of output 96 [2018-04-10 14:13:53,162 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 122 DAG size of output 120 [2018-04-10 14:13:53,345 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 87 DAG size of output 87 [2018-04-10 14:13:53,943 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 141 DAG size of output 83 [2018-04-10 14:13:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:54,256 INFO L93 Difference]: Finished difference Result 314 states and 327 transitions. [2018-04-10 14:13:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:13:54,256 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2018-04-10 14:13:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:54,256 INFO L225 Difference]: With dead ends: 314 [2018-04-10 14:13:54,256 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 14:13:54,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=738, Invalid=5424, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 14:13:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 14:13:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 197. [2018-04-10 14:13:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 14:13:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2018-04-10 14:13:54,261 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 60 [2018-04-10 14:13:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:54,261 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2018-04-10 14:13:54,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:13:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2018-04-10 14:13:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:13:54,262 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:54,262 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:54,262 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash -594351121, now seen corresponding path program 2 times [2018-04-10 14:13:54,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:54,263 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:54,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:54,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:13:54,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:54,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:54,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:54,537 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:13:54,573 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:13:54,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:13:54,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:54,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:54,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:54,638 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-10 14:13:54,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:13:54,656 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-10 14:13:54,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:13:54,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,667 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-10 14:13:54,668 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-10 14:13:54,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,674 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-10 14:13:54,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:23 [2018-04-10 14:13:54,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 14:13:54,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:54,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 14:13:54,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:54,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,758 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-10 14:13:54,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:49 [2018-04-10 14:13:54,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:54,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:54,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:54,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:54,916 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 42 [2018-04-10 14:13:54,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:54,949 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-10 14:13:54,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:75 [2018-04-10 14:13:54,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2018-04-10 14:13:55,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-10 14:13:55,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:55,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:55,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:55,048 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 72 treesize of output 77 [2018-04-10 14:13:55,049 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:55,050 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 22 treesize of output 21 [2018-04-10 14:13:55,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,062 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 76 treesize of output 75 [2018-04-10 14:13:55,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:13:55,069 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:55,082 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:55,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:55,109 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:97, output treesize:169 [2018-04-10 14:13:55,195 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 136 treesize of output 124 [2018-04-10 14:13:55,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:13:55,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 112 [2018-04-10 14:13:55,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:13:55,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,240 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-10 14:13:55,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:161, output treesize:129 [2018-04-10 14:13:55,329 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 111 treesize of output 98 [2018-04-10 14:13:55,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:13:55,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:55,338 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 76 treesize of output 66 [2018-04-10 14:13:55,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,352 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-10 14:13:55,352 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:146, output treesize:98 [2018-04-10 14:13:55,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:55,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:55,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:55,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 80 [2018-04-10 14:13:55,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:55,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-04-10 14:13:55,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,446 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 29 treesize of output 18 [2018-04-10 14:13:55,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:55,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-10 14:13:55,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:55,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:55,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:55,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:102, output treesize:28 [2018-04-10 14:13:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:55,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:55,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-10 14:13:55,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:13:55,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:13:55,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:13:55,554 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand 42 states. [2018-04-10 14:13:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:13:57,240 INFO L93 Difference]: Finished difference Result 289 states and 305 transitions. [2018-04-10 14:13:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 14:13:57,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2018-04-10 14:13:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:13:57,241 INFO L225 Difference]: With dead ends: 289 [2018-04-10 14:13:57,241 INFO L226 Difference]: Without dead ends: 289 [2018-04-10 14:13:57,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=796, Invalid=4606, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 14:13:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-10 14:13:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 205. [2018-04-10 14:13:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-10 14:13:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 219 transitions. [2018-04-10 14:13:57,245 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 219 transitions. Word has length 60 [2018-04-10 14:13:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:13:57,245 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 219 transitions. [2018-04-10 14:13:57,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:13:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 219 transitions. [2018-04-10 14:13:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:13:57,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:13:57,246 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:13:57,246 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:13:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash -594351120, now seen corresponding path program 2 times [2018-04-10 14:13:57,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:13:57,246 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:13:57,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:57,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:13:57,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:13:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:13:57,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:13:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:57,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:13:57,627 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:13:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:13:57,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:13:57,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:13:57,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:13:57,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:57,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:57,715 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-10 14:13:57,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:13:57,739 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-10 14:13:57,740 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-10 14:13:57,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,749 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-10 14:13:57,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:13:57,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:13:57,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:13:57,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:57,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:13:57,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:13:57,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,839 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-10 14:13:57,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2018-04-10 14:13:57,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:57,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:57,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:57,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:57,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 14:13:57,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:57,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, 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-10 14:13:57,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,000 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-10 14:13:58,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:71 [2018-04-10 14:13:58,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,040 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 45 treesize of output 49 [2018-04-10 14:13:58,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2018-04-10 14:13:58,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:13:58,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:13:58,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 83 [2018-04-10 14:13:58,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,086 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 54 [2018-04-10 14:13:58,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-04-10 14:13:58,104 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 14:13:58,104 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,134 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 2 xjuncts. [2018-04-10 14:13:58,134 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:213 [2018-04-10 14:13:58,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 138 [2018-04-10 14:13:58,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:13:58,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,259 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 142 treesize of output 138 [2018-04-10 14:13:58,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:13:58,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,277 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-10 14:13:58,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:161, output treesize:129 [2018-04-10 14:13:58,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:13:58,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 140 [2018-04-10 14:13:58,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,463 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 64 [2018-04-10 14:13:58,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:13:58,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:13:58,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-04-10 14:13:58,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:58,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:13:58,505 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 43 treesize of output 41 [2018-04-10 14:13:58,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:13:58,507 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 29 treesize of output 29 [2018-04-10 14:13:58,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,515 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 26 treesize of output 11 [2018-04-10 14:13:58,515 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:13:58,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:13:58,525 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:162, output treesize:9 [2018-04-10 14:13:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:13:58,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:13:58,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-10 14:13:58,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:13:58,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:13:58,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1562, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:13:58,605 INFO L87 Difference]: Start difference. First operand 205 states and 219 transitions. Second operand 42 states. [2018-04-10 14:14:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:00,827 INFO L93 Difference]: Finished difference Result 320 states and 335 transitions. [2018-04-10 14:14:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:14:00,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2018-04-10 14:14:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:00,828 INFO L225 Difference]: With dead ends: 320 [2018-04-10 14:14:00,828 INFO L226 Difference]: Without dead ends: 320 [2018-04-10 14:14:00,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=829, Invalid=5333, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 14:14:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-10 14:14:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 211. [2018-04-10 14:14:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-10 14:14:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-04-10 14:14:00,831 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 60 [2018-04-10 14:14:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:00,831 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-04-10 14:14:00,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:14:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-04-10 14:14:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:14:00,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:00,832 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:00,832 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1393747136, now seen corresponding path program 1 times [2018-04-10 14:14:00,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:00,832 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:00,832 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:00,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:14:00,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:00,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:01,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:01,010 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:01,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:01,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:01,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:14:01,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:01,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:41 [2018-04-10 14:14:01,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:01,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:01,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:01,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-10 14:14:01,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:42 [2018-04-10 14:14:01,222 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 3 case distinctions, treesize of input 32 treesize of output 42 [2018-04-10 14:14:01,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-04-10 14:14:01,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2018-04-10 14:14:01,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:01,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:01,289 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:01,290 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 49 treesize of output 45 [2018-04-10 14:14:01,292 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 21 [2018-04-10 14:14:01,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,307 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,317 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 3 case distinctions, treesize of input 50 treesize of output 72 [2018-04-10 14:14:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-04-10 14:14:01,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,363 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:01,411 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:61, output treesize:113 [2018-04-10 14:14:01,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:01,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:01,636 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 1 case distinctions, treesize of input 112 treesize of output 125 [2018-04-10 14:14:01,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:01,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-04-10 14:14:01,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:01,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:01,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 116 [2018-04-10 14:14:01,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:01,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,773 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-04-10 14:14: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:01,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,814 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:01,845 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:189, output treesize:149 [2018-04-10 14:14:01,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2018-04-10 14:14:01,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:01,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:01,992 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 159 treesize of output 144 [2018-04-10 14:14:01,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:14:01,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:02,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:233, output treesize:209 [2018-04-10 14:14:02,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-04-10 14:14:02,169 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-10 14:14:02,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,178 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 34 treesize of output 26 [2018-04-10 14:14:02,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 126 [2018-04-10 14:14:02,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 100 [2018-04-10 14:14:02,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 89 [2018-04-10 14:14:02,246 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:02,273 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 73 [2018-04-10 14:14:02,274 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:02,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-04-10 14:14:02,298 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2018-04-10 14:14:02,321 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:02,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:02,370 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:237, output treesize:190 [2018-04-10 14:14:02,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-10 14:14:02,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-10 14:14:02,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:02,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:02,565 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 75 treesize of output 73 [2018-04-10 14:14:02,566 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-10 14:14:02,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-10 14:14:02,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,609 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 79 treesize of output 73 [2018-04-10 14:14:02,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-10 14:14:02,611 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,619 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-10 14:14:02,619 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-10 14:14:02,660 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:208, output treesize:142 [2018-04-10 14:14:02,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 14:14:02,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:14:02,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,791 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-10 14:14:02,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:02,794 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-10 14:14:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:02,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:02,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2018-04-10 14:14:02,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 14:14:02,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 14:14:02,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:14:02,837 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 37 states. [2018-04-10 14:14:04,210 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 171 DAG size of output 102 [2018-04-10 14:14:04,564 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 159 DAG size of output 121 [2018-04-10 14:14:04,722 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 143 DAG size of output 113 [2018-04-10 14:14:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:05,992 INFO L93 Difference]: Finished difference Result 335 states and 349 transitions. [2018-04-10 14:14:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:14:05,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2018-04-10 14:14:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:05,993 INFO L225 Difference]: With dead ends: 335 [2018-04-10 14:14:05,993 INFO L226 Difference]: Without dead ends: 335 [2018-04-10 14:14:05,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=831, Invalid=4571, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 14:14:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-10 14:14:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 257. [2018-04-10 14:14:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-10 14:14:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 280 transitions. [2018-04-10 14:14:05,997 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 280 transitions. Word has length 63 [2018-04-10 14:14:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:05,997 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 280 transitions. [2018-04-10 14:14:05,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 14:14:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 280 transitions. [2018-04-10 14:14:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 14:14:05,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:05,998 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:05,998 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash -965824490, now seen corresponding path program 1 times [2018-04-10 14:14:05,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:05,998 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:05,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:05,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:06,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:06,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:06,364 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:06,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:06,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:06,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:14:06,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:06,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:41 [2018-04-10 14:14:06,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:06,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:06,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:06,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-10 14:14:06,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-04-10 14:14:06,557 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 3 case distinctions, treesize of input 32 treesize of output 42 [2018-04-10 14:14:06,559 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 33 treesize of output 36 [2018-04-10 14:14:06,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2018-04-10 14:14:06,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:06,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:06,605 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 49 treesize of output 40 [2018-04-10 14:14:06,607 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 28 treesize of output 18 [2018-04-10 14:14:06,607 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,621 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 3 case distinctions, treesize of input 50 treesize of output 72 [2018-04-10 14:14:06,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-04-10 14:14:06,623 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:06,663 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:61, output treesize:91 [2018-04-10 14:14:06,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-10 14:14:06,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:06,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:06,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 98 [2018-04-10 14:14:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:06,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-04-10 14:14:06,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:06,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:06,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 89 [2018-04-10 14:14:06,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:06,858 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,867 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:06,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:06,883 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:167, output treesize:127 [2018-04-10 14:14:07,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-04-10 14:14:07,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:07,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 129 [2018-04-10 14:14:07,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:14:07,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:07,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:213, output treesize:189 [2018-04-10 14:14:07,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-04-10 14:14:07,195 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-10 14:14:07,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,205 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-10 14:14:07,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,238 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 142 treesize of output 127 [2018-04-10 14:14:07,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 107 [2018-04-10 14:14:07,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,251 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 107 treesize of output 80 [2018-04-10 14:14:07,251 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:07,285 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:217, output treesize:145 [2018-04-10 14:14:07,410 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 105 treesize of output 83 [2018-04-10 14:14:07,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:14:07,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:14:07,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-04-10 14:14:07,440 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-10 14:14:07,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-10 14:14:07,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:07,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:07,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:07,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:175, output treesize:137 [2018-04-10 14:14:07,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 14:14:07,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 14:14:07,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,638 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-10 14:14:07,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:10 [2018-04-10 14:14:07,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:07,652 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-10 14:14:07,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:07,656 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-10 14:14:07,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-10 14:14:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:07,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:07,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2018-04-10 14:14:07,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:14:07,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:14:07,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:14:07,722 INFO L87 Difference]: Start difference. First operand 257 states and 280 transitions. Second operand 46 states. [2018-04-10 14:14:09,001 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 124 DAG size of output 102 [2018-04-10 14:14:09,366 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 113 DAG size of output 101 [2018-04-10 14:14:09,778 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 125 DAG size of output 105 [2018-04-10 14:14:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:11,527 INFO L93 Difference]: Finished difference Result 356 states and 371 transitions. [2018-04-10 14:14:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 14:14:11,527 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 64 [2018-04-10 14:14:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:11,528 INFO L225 Difference]: With dead ends: 356 [2018-04-10 14:14:11,528 INFO L226 Difference]: Without dead ends: 356 [2018-04-10 14:14:11,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1142, Invalid=6868, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 14:14:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-04-10 14:14:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 264. [2018-04-10 14:14:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-10 14:14:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 288 transitions. [2018-04-10 14:14:11,531 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 288 transitions. Word has length 64 [2018-04-10 14:14:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:11,532 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 288 transitions. [2018-04-10 14:14:11,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:14:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 288 transitions. [2018-04-10 14:14:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 14:14:11,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:11,532 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:11,533 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash -965824489, now seen corresponding path program 1 times [2018-04-10 14:14:11,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:11,533 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:11,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:11,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:11,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:11,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:14:11,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:11,627 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:11,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:11,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:14:11,670 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 19 treesize of output 11 [2018-04-10 14:14:11,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:11,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:11,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:14:11,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:14:11,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:11,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:11,679 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-10 14:14:11,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:14:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:14:11,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:11,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-04-10 14:14:11,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:14:11,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:14:11,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:14:11,700 INFO L87 Difference]: Start difference. First operand 264 states and 288 transitions. Second operand 9 states. [2018-04-10 14:14:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:11,943 INFO L93 Difference]: Finished difference Result 321 states and 338 transitions. [2018-04-10 14:14:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:14:11,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-04-10 14:14:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:11,944 INFO L225 Difference]: With dead ends: 321 [2018-04-10 14:14:11,944 INFO L226 Difference]: Without dead ends: 321 [2018-04-10 14:14:11,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:14:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-10 14:14:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 278. [2018-04-10 14:14:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-10 14:14:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 303 transitions. [2018-04-10 14:14:11,947 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 303 transitions. Word has length 64 [2018-04-10 14:14:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:11,947 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 303 transitions. [2018-04-10 14:14:11,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:14:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 303 transitions. [2018-04-10 14:14:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:14:11,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:11,948 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:11,948 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1875985662, now seen corresponding path program 2 times [2018-04-10 14:14:11,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:11,948 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:11,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:11,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:11,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:11,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:12,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:12,293 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:14:12,318 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:14:12,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:14:12,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:12,354 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-10 14:14:12,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:12,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 14:14:12,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:14:12,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-10 14:14:12,414 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-10 14:14:12,415 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-10 14:14:12,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-10 14:14:12,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-10 14:14:12,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:12,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,479 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-10 14:14:12,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-10 14:14:12,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-10 14:14:12,509 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-10 14:14:12,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:14:12,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,516 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:22 [2018-04-10 14:14:12,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-10 14:14:12,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:12,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:12,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-04-10 14:14:12,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,599 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 17 treesize of output 21 [2018-04-10 14:14:12,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,606 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-10 14:14:12,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:40 [2018-04-10 14:14:12,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 63 [2018-04-10 14:14:12,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 14:14:12,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,715 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-10 14:14:12,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-04-10 14:14:12,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 78 [2018-04-10 14:14:12,774 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 56 treesize of output 40 [2018-04-10 14:14:12,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:12,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2018-04-10 14:14:12,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:12,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:12,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2018-04-10 14:14:12,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:12,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:14:12,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:12,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:155 [2018-04-10 14:14:13,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,036 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 65 treesize of output 77 [2018-04-10 14:14:13,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,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, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-04-10 14:14:13,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:13,120 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 47 treesize of output 55 [2018-04-10 14:14:13,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:13,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:170, output treesize:180 [2018-04-10 14:14:13,254 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 63 treesize of output 60 [2018-04-10 14:14:13,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:14:13,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,346 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 85 treesize of output 82 [2018-04-10 14:14:13,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-10 14:14:13,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-10 14:14:13,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:14:13,418 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:13,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:222, output treesize:226 [2018-04-10 14:14:13,670 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 92 treesize of output 96 [2018-04-10 14:14:13,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:13,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2018-04-10 14:14:13,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:13,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2018-04-10 14:14:13,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:13,826 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,837 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:13,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:13,886 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:289, output treesize:265 [2018-04-10 14:14:14,120 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 98 treesize of output 107 [2018-04-10 14:14:14,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:14,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:14,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:14,213 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 140 [2018-04-10 14:14:14,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 124 [2018-04-10 14:14:14,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:14,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:14,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 131 [2018-04-10 14:14:14,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:14,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:14,440 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 3 case distinctions, treesize of input 99 treesize of output 115 [2018-04-10 14:14:14,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2018-04-10 14:14:14,442 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:14,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:14,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 106 [2018-04-10 14:14:14,497 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:14,535 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:14,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 24 dim-0 vars, and 5 xjuncts. [2018-04-10 14:14:14,637 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 19 variables, input treesize:322, output treesize:479 [2018-04-10 14:14:14,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 106 [2018-04-10 14:14:14,893 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 98 treesize of output 91 [2018-04-10 14:14:14,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:14,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:14,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:14,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:14,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 96 [2018-04-10 14:14:14,940 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:14,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 95 [2018-04-10 14:14:14,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:15,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2018-04-10 14:14:15,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:15,115 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 86 treesize of output 79 [2018-04-10 14:14:15,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:15,117 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 89 treesize of output 82 [2018-04-10 14:14:15,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:15,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 14:14:15,250 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 85 treesize of output 75 [2018-04-10 14:14:15,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:14:15,254 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:15,271 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-10 14:14:15,271 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:15,280 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:15,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-04-10 14:14:15,370 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:196, output treesize:448 [2018-04-10 14:14:16,045 WARN L148 SmtUtils]: Spent 591ms on a formula simplification that was a NOOP. DAG size: 173 [2018-04-10 14:14:16,272 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 110 DAG size of output 95 [2018-04-10 14:14:16,282 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-04-10 14:14:16,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:16,284 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 25 treesize of output 17 [2018-04-10 14:14:16,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:16,292 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-10 14:14:16,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:16,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:16,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:16,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:247, output treesize:28 [2018-04-10 14:14:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:16,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:16,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2018-04-10 14:14:16,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 14:14:16,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 14:14:16,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2117, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 14:14:16,467 INFO L87 Difference]: Start difference. First operand 278 states and 303 transitions. Second operand 49 states. [2018-04-10 14:14:18,158 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 176 DAG size of output 108 [2018-04-10 14:14:18,671 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 267 DAG size of output 75 [2018-04-10 14:14:19,034 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 66 DAG size of output 46 [2018-04-10 14:14:20,071 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 172 DAG size of output 109 [2018-04-10 14:14:20,526 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 264 DAG size of output 76 [2018-04-10 14:14:20,984 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 105 DAG size of output 92 [2018-04-10 14:14:21,160 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 109 DAG size of output 94 [2018-04-10 14:14:21,370 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-04-10 14:14:21,564 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 122 DAG size of output 109 [2018-04-10 14:14:21,844 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 167 DAG size of output 142 [2018-04-10 14:14:22,816 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 263 DAG size of output 157 [2018-04-10 14:14:23,338 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 99 DAG size of output 88 [2018-04-10 14:14:23,493 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 101 DAG size of output 90 [2018-04-10 14:14:23,698 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 122 DAG size of output 107 [2018-04-10 14:14:24,032 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 116 DAG size of output 105 [2018-04-10 14:14:24,466 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 165 DAG size of output 140 [2018-04-10 14:14:25,298 WARN L151 SmtUtils]: Spent 465ms on a formula simplification. DAG size of input: 262 DAG size of output 159 [2018-04-10 14:14:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:25,509 INFO L93 Difference]: Finished difference Result 471 states and 502 transitions. [2018-04-10 14:14:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 14:14:25,509 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 65 [2018-04-10 14:14:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:25,512 INFO L225 Difference]: With dead ends: 471 [2018-04-10 14:14:25,512 INFO L226 Difference]: Without dead ends: 471 [2018-04-10 14:14:25,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4894 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2236, Invalid=14276, Unknown=0, NotChecked=0, Total=16512 [2018-04-10 14:14:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-10 14:14:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 278. [2018-04-10 14:14:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-10 14:14:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 302 transitions. [2018-04-10 14:14:25,516 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 302 transitions. Word has length 65 [2018-04-10 14:14:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:25,516 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 302 transitions. [2018-04-10 14:14:25,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 14:14:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 302 transitions. [2018-04-10 14:14:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:14:25,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:25,517 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:25,517 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1875985661, now seen corresponding path program 2 times [2018-04-10 14:14:25,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:25,517 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:25,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:25,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:14:25,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:25,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:26,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:26,019 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:26,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:14:26,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:14:26,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:14:26,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:26,099 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-10 14:14:26,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:26,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 14:14:26,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,143 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-10 14:14:26,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-10 14:14:26,173 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-10 14:14:26,174 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-10 14:14:26,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2018-04-10 14:14:26,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-10 14:14:26,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:26,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,250 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-10 14:14:26,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-10 14:14:26,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-04-10 14:14:26,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:26,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:26,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:68 [2018-04-10 14:14:26,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-10 14:14:26,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,413 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-10 14:14:26,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:85 [2018-04-10 14:14:26,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-04-10 14:14:26,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:14:26,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:26,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:26,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:26,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:178 [2018-04-10 14:14:26,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,615 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 88 treesize of output 96 [2018-04-10 14:14:26,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:26,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:26,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:93 [2018-04-10 14:14:26,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,790 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 36 treesize of output 61 [2018-04-10 14:14:26,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:14:26,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,810 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-10 14:14:26,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:134, output treesize:138 [2018-04-10 14:14:26,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 87 [2018-04-10 14:14:26,871 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 34 treesize of output 17 [2018-04-10 14:14:26,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,890 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-10 14:14:26,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:156, output treesize:138 [2018-04-10 14:14:26,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:26,947 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 33 treesize of output 61 [2018-04-10 14:14:26,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:26,961 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-10 14:14:26,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:143, output treesize:135 [2018-04-10 14:14:27,013 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 130 treesize of output 104 [2018-04-10 14:14:27,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:14:27,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:27,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:27,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:27,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:146, output treesize:266 [2018-04-10 14:14:27,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:27,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:27,179 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 135 treesize of output 138 [2018-04-10 14:14:27,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:27,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,205 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-10 14:14:27,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:147, output treesize:131 [2018-04-10 14:14:27,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 89 [2018-04-10 14:14:27,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-10 14:14:27,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-10 14:14:27,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:27,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-10 14:14:27,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-10 14:14:27,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:27,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:27,312 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-10 14:14:27,312 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:183, output treesize:55 [2018-04-10 14:14:27,357 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 41 treesize of output 62 [2018-04-10 14:14:27,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:27,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:27,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:64 [2018-04-10 14:14:27,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2018-04-10 14:14:27,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:14:27,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,475 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-10 14:14:27,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,479 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-10 14:14:27,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:27,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:14:27,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:27,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:27,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:27,493 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:71, output treesize:18 [2018-04-10 14:14:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:27,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:27,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31] total 52 [2018-04-10 14:14:27,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 14:14:27,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 14:14:27,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2419, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:14:27,588 INFO L87 Difference]: Start difference. First operand 278 states and 302 transitions. Second operand 52 states. [2018-04-10 14:14:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:31,184 INFO L93 Difference]: Finished difference Result 439 states and 455 transitions. [2018-04-10 14:14:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 14:14:31,184 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 65 [2018-04-10 14:14:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:31,185 INFO L225 Difference]: With dead ends: 439 [2018-04-10 14:14:31,185 INFO L226 Difference]: Without dead ends: 439 [2018-04-10 14:14:31,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1100, Invalid=8406, Unknown=0, NotChecked=0, Total=9506 [2018-04-10 14:14:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-10 14:14:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 307. [2018-04-10 14:14:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-04-10 14:14:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 332 transitions. [2018-04-10 14:14:31,190 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 332 transitions. Word has length 65 [2018-04-10 14:14:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:31,190 INFO L459 AbstractCegarLoop]: Abstraction has 307 states and 332 transitions. [2018-04-10 14:14:31,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 14:14:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 332 transitions. [2018-04-10 14:14:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:14:31,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:31,191 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:31,191 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1283781, now seen corresponding path program 3 times [2018-04-10 14:14:31,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:31,191 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:31,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:31,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:14:31,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:31,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:31,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:31,543 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:31,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:14:31,587 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:14:31,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:14:31,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:31,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-10 14:14:31,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-04-10 14:14:31,725 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 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 14:14:31,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:14:31,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-04-10 14:14:31,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:31,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:31,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:31,752 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:54 [2018-04-10 14:14:31,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 14:14:31,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:31,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-04-10 14:14:31,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:31,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:31,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:31,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:72 [2018-04-10 14:14:32,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,010 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 56 treesize of output 76 [2018-04-10 14:14:32,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,037 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 92 treesize of output 128 [2018-04-10 14:14:32,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:32,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:149, output treesize:157 [2018-04-10 14:14:32,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 83 [2018-04-10 14:14:32,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:14:32,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,139 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 122 treesize of output 127 [2018-04-10 14:14:32,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 16 treesize of output 15 [2018-04-10 14:14:32,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 103 [2018-04-10 14:14:32,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:14:32,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:32,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:32,269 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 73 treesize of output 64 [2018-04-10 14:14:32,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:14:32,277 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:32,294 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:32,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 14:14:32,368 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:205, output treesize:347 [2018-04-10 14:14:32,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 152 [2018-04-10 14:14:32,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:32,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,593 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 103 treesize of output 108 [2018-04-10 14:14:32,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:32,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:32,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 143 treesize of output 147 [2018-04-10 14:14:32,663 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 156 treesize of output 155 [2018-04-10 14:14:32,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,715 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 107 [2018-04-10 14:14:32,715 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:32,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:32,810 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 99 treesize of output 103 [2018-04-10 14:14:32,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:32,811 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:32,865 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:247, output treesize:313 [2018-04-10 14:14:32,967 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 138 treesize of output 116 [2018-04-10 14:14:32,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:14:32,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,982 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-10 14:14:32,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:32,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,036 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 131 [2018-04-10 14:14:33,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:14:33,038 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:14:33,052 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 176 [2018-04-10 14:14:33,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:14:33,105 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:14:33,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,129 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:33,166 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:486, output treesize:368 [2018-04-10 14:14:33,246 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 179 treesize of output 164 [2018-04-10 14:14:33,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:14:33,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,306 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 115 treesize of output 104 [2018-04-10 14:14:33,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:33,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,355 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 116 treesize of output 105 [2018-04-10 14:14:33,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:33,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:33,396 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:411, output treesize:371 [2018-04-10 14:14:33,703 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 112 treesize of output 100 [2018-04-10 14:14:33,705 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-10 14:14:33,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,750 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2018-04-10 14:14:33,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 14:14:33,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:33,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:33,820 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 1 case distinctions, treesize of input 177 treesize of output 181 [2018-04-10 14:14:33,822 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 172 treesize of output 165 [2018-04-10 14:14:33,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:33,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 159 [2018-04-10 14:14:33,860 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:33,902 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:14:33,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 17 dim-0 vars, and 6 xjuncts. [2018-04-10 14:14:33,987 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 11 variables, input treesize:403, output treesize:748 [2018-04-10 14:14:34,229 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 70 [2018-04-10 14:14:34,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-10 14:14:34,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:34,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:14:34,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:34,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:34,262 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 25 treesize of output 17 [2018-04-10 14:14:34,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:34,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:34,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 106 [2018-04-10 14:14:34,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 74 [2018-04-10 14:14:34,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:34,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-04-10 14:14:34,417 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:34,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-04-10 14:14:34,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:34,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:34,480 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 80 treesize of output 70 [2018-04-10 14:14:34,480 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:34,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-10 14:14:34,512 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:34,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-10 14:14:34,538 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:34,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:34,564 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:34,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-04-10 14:14:34,565 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:34,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:34,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:34,618 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 23 variables, input treesize:540, output treesize:115 [2018-04-10 14:14:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:34,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:34,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2018-04-10 14:14:34,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 14:14:34,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 14:14:34,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2339, Unknown=2, NotChecked=0, Total=2550 [2018-04-10 14:14:34,777 INFO L87 Difference]: Start difference. First operand 307 states and 332 transitions. Second operand 51 states. [2018-04-10 14:14:36,458 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 188 DAG size of output 117 [2018-04-10 14:14:36,755 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 210 DAG size of output 136 [2018-04-10 14:14:36,999 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 222 DAG size of output 130 [2018-04-10 14:14:37,834 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 246 DAG size of output 133 [2018-04-10 14:14:38,380 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 171 DAG size of output 136 [2018-04-10 14:14:38,678 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 193 DAG size of output 156 [2018-04-10 14:14:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:39,978 INFO L93 Difference]: Finished difference Result 389 states and 414 transitions. [2018-04-10 14:14:39,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 14:14:39,978 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 65 [2018-04-10 14:14:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:39,979 INFO L225 Difference]: With dead ends: 389 [2018-04-10 14:14:39,979 INFO L226 Difference]: Without dead ends: 389 [2018-04-10 14:14:39,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3011 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1518, Invalid=9179, Unknown=15, NotChecked=0, Total=10712 [2018-04-10 14:14:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-10 14:14:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 315. [2018-04-10 14:14:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-10 14:14:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 341 transitions. [2018-04-10 14:14:39,982 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 341 transitions. Word has length 65 [2018-04-10 14:14:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:39,982 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 341 transitions. [2018-04-10 14:14:39,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 14:14:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 341 transitions. [2018-04-10 14:14:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:14:39,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:39,982 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:39,982 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1283782, now seen corresponding path program 3 times [2018-04-10 14:14:39,983 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:39,983 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:39,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:39,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:14:39,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:39,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:40,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:40,347 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:14:40,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:14:40,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:14:40,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:40,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,484 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-10 14:14:40,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:14:40,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:14:40,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, 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-10 14:14:40,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:14:40,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 8 treesize of output 7 [2018-04-10 14:14:40,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,539 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:14:40,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:14:40,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:40,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:14:40,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:40,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,631 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-10 14:14:40,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2018-04-10 14:14:40,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,775 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 42 [2018-04-10 14:14:40,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,793 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 14 treesize of output 21 [2018-04-10 14:14:40,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,806 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-10 14:14:40,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:91 [2018-04-10 14:14:40,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:14:40,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:14:40,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:40,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:40,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:40,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-04-10 14:14:40,905 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 22 treesize of output 17 [2018-04-10 14:14:40,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:40,918 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 83 treesize of output 78 [2018-04-10 14:14:40,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:14:40,924 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:40,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:40,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:40,969 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:113, output treesize:185 [2018-04-10 14:14:41,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:14:41,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:41,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,109 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 96 treesize of output 96 [2018-04-10 14:14:41,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:41,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,134 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-10 14:14:41,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:107 [2018-04-10 14:14:41,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:41,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:41,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:41,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:41,344 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 33 treesize of output 61 [2018-04-10 14:14:41,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,364 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 31 treesize of output 66 [2018-04-10 14:14:41,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,381 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-10 14:14:41,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:161, output treesize:152 [2018-04-10 14:14:41,434 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 141 treesize of output 123 [2018-04-10 14:14:41,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:14:41,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:41,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:41,510 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 139 treesize of output 138 [2018-04-10 14:14:41,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:41,512 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-10 14:14:41,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,533 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 131 treesize of output 130 [2018-04-10 14:14:41,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-04-10 14:14:41,535 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:41,595 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:174, output treesize:275 [2018-04-10 14:14:41,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 146 [2018-04-10 14:14:41,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 14:14:41,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-10 14:14:41,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:14:41,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,780 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-10 14:14:41,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:233, output treesize:201 [2018-04-10 14:14:41,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 106 [2018-04-10 14:14:41,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:14:41,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:41,904 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 37 treesize of output 27 [2018-04-10 14:14:41,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-10 14:14:41,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:41,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-04-10 14:14:41,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:41,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:41,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 14:14:41,955 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:41,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:14:41,955 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,959 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-10 14:14:41,959 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:41,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:41,970 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:218, output treesize:34 [2018-04-10 14:14:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:42,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:42,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2018-04-10 14:14:42,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 14:14:42,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 14:14:42,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2149, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 14:14:42,087 INFO L87 Difference]: Start difference. First operand 315 states and 341 transitions. Second operand 49 states. [2018-04-10 14:14:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:45,924 INFO L93 Difference]: Finished difference Result 454 states and 471 transitions. [2018-04-10 14:14:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 14:14:45,925 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 65 [2018-04-10 14:14:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:45,925 INFO L225 Difference]: With dead ends: 454 [2018-04-10 14:14:45,925 INFO L226 Difference]: Without dead ends: 454 [2018-04-10 14:14:45,926 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1056, Invalid=7497, Unknown=3, NotChecked=0, Total=8556 [2018-04-10 14:14:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-04-10 14:14:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 321. [2018-04-10 14:14:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-10 14:14:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 347 transitions. [2018-04-10 14:14:45,929 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 347 transitions. Word has length 65 [2018-04-10 14:14:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:45,929 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 347 transitions. [2018-04-10 14:14:45,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 14:14:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 347 transitions. [2018-04-10 14:14:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 14:14:45,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:45,929 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:45,929 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash -444393480, now seen corresponding path program 1 times [2018-04-10 14:14:45,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:45,930 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:45,930 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:45,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:14:45,930 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:45,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:46,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:46,152 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:46,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:46,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:46,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:46,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:46,185 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-10 14:14:46,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:14:46,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:14:46,203 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-10 14:14:46,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,212 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-10 14:14:46,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:46,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,221 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-10 14:14:46,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2018-04-10 14:14:46,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-10 14:14:46,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:46,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:14:46,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 14 treesize of output 13 [2018-04-10 14:14:46,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,286 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-10 14:14:46,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:14:46,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:46,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:46,380 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-10 14:14:46,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,385 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-10 14:14:46,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:53 [2018-04-10 14:14:46,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:14:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:14:46,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:46,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:46,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:46,446 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 63 treesize of output 64 [2018-04-10 14:14:46,448 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 22 treesize of output 17 [2018-04-10 14:14:46,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,459 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 71 treesize of output 66 [2018-04-10 14:14:46,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:14:46,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:46,476 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:46,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:46,496 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:77 [2018-04-10 14:14:46,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-04-10 14:14:46,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 14:14:46,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:14:46,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:12 [2018-04-10 14:14:46,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:14:46,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:46,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-04-10 14:14:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:14:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:14:46,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:46,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-10 14:14:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:46,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:46,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 30 [2018-04-10 14:14:46,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:14:46,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:14:46,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:14:46,582 INFO L87 Difference]: Start difference. First operand 321 states and 347 transitions. Second operand 31 states. [2018-04-10 14:14:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:47,651 INFO L93 Difference]: Finished difference Result 374 states and 390 transitions. [2018-04-10 14:14:47,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:14:47,651 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-04-10 14:14:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:47,652 INFO L225 Difference]: With dead ends: 374 [2018-04-10 14:14:47,652 INFO L226 Difference]: Without dead ends: 374 [2018-04-10 14:14:47,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=602, Invalid=3180, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:14:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-10 14:14:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2018-04-10 14:14:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-10 14:14:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-04-10 14:14:47,655 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 66 [2018-04-10 14:14:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:47,655 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-04-10 14:14:47,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:14:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-04-10 14:14:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 14:14:47,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:47,655 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:47,655 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash -291633487, now seen corresponding path program 1 times [2018-04-10 14:14:47,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:47,656 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:47,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:47,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:47,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:47,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:47,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:47,826 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:47,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:47,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:47,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:47,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:47,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:47,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-10 14:14:47,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:47,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:47,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:26 [2018-04-10 14:14:47,974 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 3 case distinctions, treesize of input 19 treesize of output 43 [2018-04-10 14:14:47,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2018-04-10 14:14:47,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:47,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-04-10 14:14:47,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,027 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 3 case distinctions, treesize of input 41 treesize of output 51 [2018-04-10 14:14:48,028 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 42 treesize of output 45 [2018-04-10 14:14:48,029 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2018-04-10 14:14:48,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,068 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:48,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:48,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-04-10 14:14:48,070 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 34 treesize of output 25 [2018-04-10 14:14:48,070 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,074 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,090 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:48, output treesize:69 [2018-04-10 14:14:48,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-04-10 14:14:48,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:48,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,184 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 122 treesize of output 110 [2018-04-10 14:14:48,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:14:48,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,209 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 46 treesize of output 39 [2018-04-10 14:14:48,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:48,210 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 85 [2018-04-10 14:14:48,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:14:48,236 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,241 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:48,251 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:177, output treesize:129 [2018-04-10 14:14:48,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-04-10 14:14:48,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:14:48,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2018-04-10 14:14:48,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:48,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:48,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-10 14:14:48,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:14:48,448 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:14:48,453 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-10 14:14:48,458 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-10 14:14:48,458 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,462 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-10 14:14:48,462 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,485 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 93 [2018-04-10 14:14:48,486 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 77 treesize of output 68 [2018-04-10 14:14:48,487 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 67 [2018-04-10 14:14:48,506 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,529 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 71 treesize of output 62 [2018-04-10 14:14:48,529 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2018-04-10 14:14:48,551 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:48,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2018-04-10 14:14:48,552 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:48,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 65 [2018-04-10 14:14:48,578 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:48,614 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-10 14:14:48,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-10 14:14:48,647 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 4 [2018-04-10 14:14:48,647 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,653 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-04-10 14:14:48,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:14:48,656 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 14:14:48,663 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,666 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-04-10 14:14:48,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:14:48,668 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:14:48,676 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,681 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:14:48,701 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:167, output treesize:40 [2018-04-10 14:14:48,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:48,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-10 14:14:48,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:48,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:48,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 22 [2018-04-10 14:14:48,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:48,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:14:48,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:46 [2018-04-10 14:14:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:48,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:48,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-04-10 14:14:48,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 14:14:48,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 14:14:48,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:14:48,891 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 38 states. [2018-04-10 14:14:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:51,145 INFO L93 Difference]: Finished difference Result 376 states and 391 transitions. [2018-04-10 14:14:51,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 14:14:51,145 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 68 [2018-04-10 14:14:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:51,146 INFO L225 Difference]: With dead ends: 376 [2018-04-10 14:14:51,146 INFO L226 Difference]: Without dead ends: 376 [2018-04-10 14:14:51,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=977, Invalid=4723, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 14:14:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-10 14:14:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 334. [2018-04-10 14:14:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-10 14:14:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 362 transitions. [2018-04-10 14:14:51,149 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 362 transitions. Word has length 68 [2018-04-10 14:14:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:51,149 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 362 transitions. [2018-04-10 14:14:51,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 14:14:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 362 transitions. [2018-04-10 14:14:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 14:14:51,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:51,150 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:51,150 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1860367337, now seen corresponding path program 1 times [2018-04-10 14:14:51,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:51,150 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:51,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:51,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:51,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:51,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:51,408 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:51,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:51,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:51,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:51,444 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-10 14:14:51,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:14:51,452 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-10 14:14:51,453 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-10 14:14:51,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,463 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-10 14:14:51,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 8 treesize of output 7 [2018-04-10 14:14:51,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:14:51,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:14:51,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:51,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-04-10 14:14:51,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:51,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,540 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-10 14:14:51,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:14:51,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:51,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:51,619 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-10 14:14:51,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,626 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-10 14:14:51,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:53 [2018-04-10 14:14:51,656 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 32 treesize of output 38 [2018-04-10 14:14:51,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:14:51,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:51,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:51,697 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 71 treesize of output 66 [2018-04-10 14:14:51,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:14:51,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:51,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:51,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:51,723 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 63 treesize of output 64 [2018-04-10 14:14:51,725 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 22 treesize of output 17 [2018-04-10 14:14:51,725 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,733 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:51,758 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:77 [2018-04-10 14:14:51,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-04-10 14:14:51,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 14:14:51,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 14:14:51,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:12 [2018-04-10 14:14:51,813 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-10 14:14:51,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:14:51,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-04-10 14:14:51,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:14:51,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:14:51,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:51,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-10 14:14:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:51,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:51,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 26 [2018-04-10 14:14:51,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 14:14:51,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 14:14:51,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-04-10 14:14:51,871 INFO L87 Difference]: Start difference. First operand 334 states and 362 transitions. Second operand 27 states. [2018-04-10 14:14:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:52,515 INFO L93 Difference]: Finished difference Result 377 states and 392 transitions. [2018-04-10 14:14:52,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:14:52,516 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2018-04-10 14:14:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:52,516 INFO L225 Difference]: With dead ends: 377 [2018-04-10 14:14:52,516 INFO L226 Difference]: Without dead ends: 377 [2018-04-10 14:14:52,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=333, Invalid=1829, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:14:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-10 14:14:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 325. [2018-04-10 14:14:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-10 14:14:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 352 transitions. [2018-04-10 14:14:52,520 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 352 transitions. Word has length 68 [2018-04-10 14:14:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:52,520 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 352 transitions. [2018-04-10 14:14:52,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 14:14:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 352 transitions. [2018-04-10 14:14:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-10 14:14:52,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:52,521 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:52,521 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1667505236, now seen corresponding path program 2 times [2018-04-10 14:14:52,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:52,521 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:52,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:52,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:52,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:52,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:53,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:53,195 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:53,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:14:53,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:14:53,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:14:53,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:53,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:14:53,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:14:53,259 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-10 14:14:53,260 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-10 14:14:53,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,268 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-10 14:14:53,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:14:53,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,275 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-10 14:14:53,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:23 [2018-04-10 14:14:53,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:14:53,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:53,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,332 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 14 [2018-04-10 14:14:53,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:53,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,341 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-10 14:14:53,341 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:49 [2018-04-10 14:14:53,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:14:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,487 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-10 14:14:53,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,498 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-10 14:14:53,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:64 [2018-04-10 14:14:53,539 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 45 treesize of output 40 [2018-04-10 14:14:53,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:14:53,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:53,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:53,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-10 14:14:53,585 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:53,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:14:53,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2018-04-10 14:14:53,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,601 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 41 [2018-04-10 14:14:53,601 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:53,631 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:86, output treesize:201 [2018-04-10 14:14:53,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,731 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 81 treesize of output 102 [2018-04-10 14:14:53,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:53,760 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 94 treesize of output 110 [2018-04-10 14:14:53,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:53,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,785 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-10 14:14:53,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:92 [2018-04-10 14:14:53,874 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 37 treesize of output 22 [2018-04-10 14:14:53,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:14:53,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:53,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:53,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:201, output treesize:185 [2018-04-10 14:14:54,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 156 [2018-04-10 14:14:54,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:14:54,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:54,017 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 126 treesize of output 108 [2018-04-10 14:14:54,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:14:54,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,049 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-10 14:14:54,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:202, output treesize:119 [2018-04-10 14:14:54,142 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:14:54,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 93 [2018-04-10 14:14:54,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:14:54,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,157 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 47 treesize of output 32 [2018-04-10 14:14:54,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 14:14:54,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:54,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:123, output treesize:25 [2018-04-10 14:14:54,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-10 14:14:54,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:54,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:14:54,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-10 14:14:54,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:54,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:54,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:54,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:21 [2018-04-10 14:14:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:54,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:54,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 48 [2018-04-10 14:14:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 14:14:54,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 14:14:54,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2080, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:14:54,363 INFO L87 Difference]: Start difference. First operand 325 states and 352 transitions. Second operand 48 states. [2018-04-10 14:14:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:14:57,784 INFO L93 Difference]: Finished difference Result 332 states and 345 transitions. [2018-04-10 14:14:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:14:57,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2018-04-10 14:14:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:14:57,785 INFO L225 Difference]: With dead ends: 332 [2018-04-10 14:14:57,785 INFO L226 Difference]: Without dead ends: 329 [2018-04-10 14:14:57,785 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=680, Invalid=5326, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 14:14:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-10 14:14:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 289. [2018-04-10 14:14:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-10 14:14:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 307 transitions. [2018-04-10 14:14:57,788 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 307 transitions. Word has length 69 [2018-04-10 14:14:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:14:57,788 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 307 transitions. [2018-04-10 14:14:57,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 14:14:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 307 transitions. [2018-04-10 14:14:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-10 14:14:57,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:14:57,789 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:14:57,789 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:14:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash 665903687, now seen corresponding path program 1 times [2018-04-10 14:14:57,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:14:57,789 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:14:57,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:57,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:14:57,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:14:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:57,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:14:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:58,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:14:58,275 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:14:58,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:14:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:14:58,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:14:58,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:14:58,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-10 14:14:58,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:14:58,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:14:58,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-10 14:14:58,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-10 14:14:58,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:58,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,468 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-10 14:14:58,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-10 14:14:58,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:14:58,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:58,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,597 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-10 14:14:58,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:14:58,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 14:14:58,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,666 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-10 14:14:58,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:60 [2018-04-10 14:14:58,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-10 14:14:58,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:14:58,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,729 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 60 treesize of output 55 [2018-04-10 14:14:58,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:14:58,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:14:58,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:14:58,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:14:58,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:142 [2018-04-10 14:14:58,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-04-10 14:14:58,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:58,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:14:58,892 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 79 treesize of output 95 [2018-04-10 14:14:58,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:14:58,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:58,914 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-10 14:14:58,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:84 [2018-04-10 14:14:59,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-04-10 14:14:59,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:14:59,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:59,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:59,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:14:59,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:163, output treesize:147 [2018-04-10 14:14:59,220 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 56 treesize of output 50 [2018-04-10 14:14:59,221 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-10 14:14:59,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:59,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-10 14:14:59,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:14:59,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:14:59,235 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-10 14:14:59,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:161, output treesize:109 [2018-04-10 14:14:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:14:59,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:14:59,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2018-04-10 14:14:59,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 14:14:59,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 14:14:59,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1692, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:14:59,315 INFO L87 Difference]: Start difference. First operand 289 states and 307 transitions. Second operand 44 states. [2018-04-10 14:15:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:02,302 INFO L93 Difference]: Finished difference Result 326 states and 337 transitions. [2018-04-10 14:15:02,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:15:02,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71 [2018-04-10 14:15:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:02,303 INFO L225 Difference]: With dead ends: 326 [2018-04-10 14:15:02,303 INFO L226 Difference]: Without dead ends: 326 [2018-04-10 14:15:02,303 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=779, Invalid=4333, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 14:15:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-10 14:15:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 263. [2018-04-10 14:15:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 14:15:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 279 transitions. [2018-04-10 14:15:02,305 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 279 transitions. Word has length 71 [2018-04-10 14:15:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:02,306 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 279 transitions. [2018-04-10 14:15:02,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 14:15:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 279 transitions. [2018-04-10 14:15:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 14:15:02,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:02,306 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:02,307 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 109994318, now seen corresponding path program 1 times [2018-04-10 14:15:02,307 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:02,307 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:02,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:02,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:02,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:02,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:15:02,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:02,399 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:02,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:02,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:15:02,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:15:02,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:15:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:15:02,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:02,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-04-10 14:15:02,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:15:02,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:15:02,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:15:02,460 INFO L87 Difference]: Start difference. First operand 263 states and 279 transitions. Second operand 9 states. [2018-04-10 14:15:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:02,626 INFO L93 Difference]: Finished difference Result 314 states and 328 transitions. [2018-04-10 14:15:02,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:15:02,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-04-10 14:15:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:02,627 INFO L225 Difference]: With dead ends: 314 [2018-04-10 14:15:02,627 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 14:15:02,627 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:15:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 14:15:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 264. [2018-04-10 14:15:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-10 14:15:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 280 transitions. [2018-04-10 14:15:02,629 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 280 transitions. Word has length 73 [2018-04-10 14:15:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:02,629 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 280 transitions. [2018-04-10 14:15:02,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:15:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 280 transitions. [2018-04-10 14:15:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 14:15:02,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:02,629 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:02,629 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash -599342185, now seen corresponding path program 1 times [2018-04-10 14:15:02,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:02,630 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:02,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:02,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:02,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:02,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:15:02,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:02,696 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:02,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:02,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:02,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:15:02,747 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 19 treesize of output 11 [2018-04-10 14:15:02,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-10 14:15:02,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-10 14:15:02,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:02,756 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-10 14:15:02,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-10 14:15:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:15:02,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:02,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-04-10 14:15:02,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:15:02,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:15:02,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:15:02,797 INFO L87 Difference]: Start difference. First operand 264 states and 280 transitions. Second operand 14 states. [2018-04-10 14:15:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:03,259 INFO L93 Difference]: Finished difference Result 346 states and 358 transitions. [2018-04-10 14:15:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 14:15:03,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-04-10 14:15:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:03,260 INFO L225 Difference]: With dead ends: 346 [2018-04-10 14:15:03,260 INFO L226 Difference]: Without dead ends: 346 [2018-04-10 14:15:03,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:15:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-10 14:15:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 278. [2018-04-10 14:15:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-10 14:15:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 295 transitions. [2018-04-10 14:15:03,263 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 295 transitions. Word has length 73 [2018-04-10 14:15:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:03,264 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 295 transitions. [2018-04-10 14:15:03,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:15:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 295 transitions. [2018-04-10 14:15:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:15:03,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:03,265 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:03,265 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:03,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1671367062, now seen corresponding path program 3 times [2018-04-10 14:15:03,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:03,265 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:03,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:03,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:15:03,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:03,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:03,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:03,692 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:03,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:15:03,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:15:03,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:15:03,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:03,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:03,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:03,829 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-10 14:15:03,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:15:03,859 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-10 14:15:03,860 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-10 14:15:03,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,869 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-10 14:15:03,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:03,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:15:03,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:15:03,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:03,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:15:03,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:03,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:03,965 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-10 14:15:03,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2018-04-10 14:15:04,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:04,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,102 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-10 14:15:04,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,116 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-10 14:15:04,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:81 [2018-04-10 14:15:04,169 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 39 treesize of output 45 [2018-04-10 14:15:04,171 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:04,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-04-10 14:15:04,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,197 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 68 treesize of output 63 [2018-04-10 14:15:04,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:15:04,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:04,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:04,236 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 2 xjuncts. [2018-04-10 14:15:04,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:189 [2018-04-10 14:15:04,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 129 [2018-04-10 14:15:04,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-04-10 14:15:04,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,434 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 3 case distinctions, treesize of input 91 treesize of output 98 [2018-04-10 14:15:04,436 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 96 treesize of output 95 [2018-04-10 14:15:04,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,489 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-10 14:15:04,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:105 [2018-04-10 14:15:04,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,693 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 24 treesize of output 39 [2018-04-10 14:15:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,716 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 70 [2018-04-10 14:15:04,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:04,743 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-10 14:15:04,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:181, output treesize:194 [2018-04-10 14:15:04,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:04,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 163 [2018-04-10 14:15:04,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 219 [2018-04-10 14:15:04,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:04,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:04,920 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:04,924 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 113 treesize of output 138 [2018-04-10 14:15:04,925 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:04,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 14:15:05,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,081 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 175 treesize of output 180 [2018-04-10 14:15:05,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 55 [2018-04-10 14:15:05,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:05,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:05,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,120 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 179 treesize of output 178 [2018-04-10 14:15:05,122 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:05,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-10 14:15:05,123 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,139 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,144 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 123 treesize of output 112 [2018-04-10 14:15:05,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,148 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 48 treesize of output 72 [2018-04-10 14:15:05,148 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,166 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 110 treesize of output 97 [2018-04-10 14:15:05,168 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 46 treesize of output 50 [2018-04-10 14:15:05,168 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,177 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 14:15:05,264 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:219, output treesize:733 [2018-04-10 14:15:05,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 294 [2018-04-10 14:15:05,557 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 315 treesize of output 314 [2018-04-10 14:15:05,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,811 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 252 [2018-04-10 14:15:05,815 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 226 treesize of output 221 [2018-04-10 14:15:05,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,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 227 treesize of output 226 [2018-04-10 14:15:05,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:05,988 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 159 treesize of output 183 [2018-04-10 14:15:05,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:05,990 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,019 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:06,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:06,070 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 147 treesize of output 160 [2018-04-10 14:15:06,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:06,071 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,087 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:06,138 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:414, output treesize:366 [2018-04-10 14:15:06,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 487 treesize of output 456 [2018-04-10 14:15:06,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 38 treesize of output 37 [2018-04-10 14:15:06,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,481 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 240 treesize of output 225 [2018-04-10 14:15:06,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:15:06,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:06,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:06,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:728, output treesize:680 [2018-04-10 14:15:07,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:07,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 221 [2018-04-10 14:15:07,206 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:07,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 171 [2018-04-10 14:15:07,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-10 14:15:07,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,253 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 134 treesize of output 99 [2018-04-10 14:15:07,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:07,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:07,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:07,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 379 [2018-04-10 14:15:07,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 347 [2018-04-10 14:15:07,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,416 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 282 treesize of output 271 [2018-04-10 14:15:07,416 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:07,480 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 271 treesize of output 245 [2018-04-10 14:15:07,480 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,548 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 242 treesize of output 207 [2018-04-10 14:15:07,548 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 273 [2018-04-10 14:15:07,611 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:07,671 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 270 treesize of output 228 [2018-04-10 14:15:07,671 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,727 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 225 treesize of output 199 [2018-04-10 14:15:07,727 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,762 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:07,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:07,812 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:732, output treesize:336 [2018-04-10 14:15:08,011 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 155 treesize of output 129 [2018-04-10 14:15:08,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 200 [2018-04-10 14:15:08,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 116 [2018-04-10 14:15:08,114 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-04-10 14:15:08,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:15:08,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,142 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-10 14:15:08,142 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 189 [2018-04-10 14:15:08,200 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 190 [2018-04-10 14:15:08,200 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:08,255 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 158 treesize of output 151 [2018-04-10 14:15:08,256 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,301 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 157 treesize of output 150 [2018-04-10 14:15:08,301 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,344 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 151 treesize of output 144 [2018-04-10 14:15:08,344 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,385 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:08,385 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 150 treesize of output 146 [2018-04-10 14:15:08,385 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 14:15:08,478 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:368, output treesize:355 [2018-04-10 14:15:08,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 63 [2018-04-10 14:15:08,650 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2018-04-10 14:15:08,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:08,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:15:08,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 14:15:08,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:08,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:08,689 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:08,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 116 [2018-04-10 14:15:08,706 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2018-04-10 14:15:08,708 INFO L267 ElimStorePlain]: Start of recursive call 7: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-04-10 14:15:08,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-04-10 14:15:08,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2018-04-10 14:15:08,776 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-04-10 14:15:08,781 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2018-04-10 14:15:08,787 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-10 14:15:08,789 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-10 14:15:08,791 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-04-10 14:15:08,797 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,891 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 43 treesize of output 42 [2018-04-10 14:15:08,891 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-10 14:15:08,896 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-10 14:15:08,898 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 62 [2018-04-10 14:15:08,904 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,922 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-10 14:15:08,922 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:08,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:08,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-04-10 14:15:08,926 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:08,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 62 [2018-04-10 14:15:08,939 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:09,007 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 42 treesize of output 23 [2018-04-10 14:15:09,007 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,008 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 46 treesize of output 27 [2018-04-10 14:15:09,008 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2018-04-10 14:15:09,009 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,010 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 42 treesize of output 23 [2018-04-10 14:15:09,010 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,011 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 42 treesize of output 23 [2018-04-10 14:15:09,011 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2018-04-10 14:15:09,013 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,013 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 46 treesize of output 27 [2018-04-10 14:15:09,014 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:09,053 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-10 14:15:09,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 8 xjuncts. [2018-04-10 14:15:09,113 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 7 variables, input treesize:231, output treesize:225 [2018-04-10 14:15:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:09,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:09,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31] total 55 [2018-04-10 14:15:09,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 14:15:09,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 14:15:09,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2817, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 14:15:09,338 INFO L87 Difference]: Start difference. First operand 278 states and 295 transitions. Second operand 56 states. [2018-04-10 14:15:12,231 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 194 DAG size of output 91 [2018-04-10 14:15:12,516 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 218 DAG size of output 115 [2018-04-10 14:15:12,774 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 181 DAG size of output 102 [2018-04-10 14:15:13,154 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 186 DAG size of output 106 [2018-04-10 14:15:13,445 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 185 DAG size of output 103 [2018-04-10 14:15:13,843 WARN L151 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 250 DAG size of output 170 [2018-04-10 14:15:14,080 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 172 [2018-04-10 14:15:14,450 WARN L151 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 188 DAG size of output 174 [2018-04-10 14:15:15,039 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 197 DAG size of output 177 [2018-04-10 14:15:15,249 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 113 DAG size of output 99 [2018-04-10 14:15:15,860 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 179 DAG size of output 100 [2018-04-10 14:15:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:16,442 INFO L93 Difference]: Finished difference Result 355 states and 374 transitions. [2018-04-10 14:15:16,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 14:15:16,443 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 74 [2018-04-10 14:15:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:16,443 INFO L225 Difference]: With dead ends: 355 [2018-04-10 14:15:16,443 INFO L226 Difference]: Without dead ends: 355 [2018-04-10 14:15:16,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3151 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1283, Invalid=9429, Unknown=0, NotChecked=0, Total=10712 [2018-04-10 14:15:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-10 14:15:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 281. [2018-04-10 14:15:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-10 14:15:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 299 transitions. [2018-04-10 14:15:16,446 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 299 transitions. Word has length 74 [2018-04-10 14:15:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:16,446 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 299 transitions. [2018-04-10 14:15:16,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 14:15:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 299 transitions. [2018-04-10 14:15:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:15:16,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:16,447 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:16,447 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1671367063, now seen corresponding path program 2 times [2018-04-10 14:15:16,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:16,447 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:16,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:16,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:15:16,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:16,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:17,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:17,068 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:17,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:15:17,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:15:17,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:15:17,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:17,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,186 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-10 14:15:17,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:15:17,234 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-10 14:15:17,235 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-10 14:15:17,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,244 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-10 14:15:17,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:17,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:15:17,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-10 14:15:17,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 14 treesize of output 13 [2018-04-10 14:15:17,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:15:17,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:17,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,336 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-10 14:15:17,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2018-04-10 14:15:17,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-10 14:15:17,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:17,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,460 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-10 14:15:17,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:82 [2018-04-10 14:15:17,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,511 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-10 14:15:17,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,521 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-10 14:15:17,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:76 [2018-04-10 14:15:17,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,565 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 58 treesize of output 62 [2018-04-10 14:15:17,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2018-04-10 14:15:17,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:17,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:17,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 96 [2018-04-10 14:15:17,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,617 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 41 [2018-04-10 14:15:17,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-04-10 14:15:17,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:17,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-10 14:15:17,636 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,644 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:17,668 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:106, output treesize:181 [2018-04-10 14:15:17,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,772 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 87 treesize of output 111 [2018-04-10 14:15:17,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:17,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-04-10 14:15:17,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:17,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,813 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-10 14:15:17,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:85 [2018-04-10 14:15:17,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:17,950 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 31 treesize of output 48 [2018-04-10 14:15:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:15:17,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:17,966 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-10 14:15:17,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:159 [2018-04-10 14:15:18,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,023 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 52 treesize of output 78 [2018-04-10 14:15:18,025 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 38 treesize of output 21 [2018-04-10 14:15:18,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,041 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-10 14:15:18,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:177, output treesize:164 [2018-04-10 14:15:18,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,099 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-10 14:15:18,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,114 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-10 14:15:18,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:172, output treesize:165 [2018-04-10 14:15:18,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,180 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 159 treesize of output 157 [2018-04-10 14:15:18,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:15:18,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:18,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:18,244 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:18,246 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 141 treesize of output 129 [2018-04-10 14:15:18,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 14:15:18,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,264 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 149 treesize of output 132 [2018-04-10 14:15:18,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,266 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:18,266 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 36 [2018-04-10 14:15:18,266 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,315 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 2 xjuncts. [2018-04-10 14:15:18,316 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:184, output treesize:253 [2018-04-10 14:15:18,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,472 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 158 [2018-04-10 14:15:18,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 168 [2018-04-10 14:15:18,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,535 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 100 [2018-04-10 14:15:18,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:18,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:18,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 144 [2018-04-10 14:15:18,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-10 14:15:18,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,654 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 106 treesize of output 105 [2018-04-10 14:15:18,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2018-04-10 14:15:18,656 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,668 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,695 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-10 14:15:18,695 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:157, output treesize:209 [2018-04-10 14:15:18,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,882 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 129 treesize of output 173 [2018-04-10 14:15:18,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-04-10 14:15:18,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:18,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 295 [2018-04-10 14:15:18,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-04-10 14:15:18,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:18,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:18,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:413, output treesize:353 [2018-04-10 14:15:19,385 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 14:15:19,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 171 [2018-04-10 14:15:19,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 14:15:19,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-10 14:15:19,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:19,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 44 [2018-04-10 14:15:19,500 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:19,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:19,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 25 [2018-04-10 14:15:19,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:19,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-04-10 14:15:19,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:19,540 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 22 treesize of output 16 [2018-04-10 14:15:19,541 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,549 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-10 14:15:19,549 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-04-10 14:15:19,553 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:19,566 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:405, output treesize:57 [2018-04-10 14:15:19,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:19,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-04-10 14:15:19,695 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-04-10 14:15:19,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:15:19,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,710 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-10 14:15:19,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,713 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-10 14:15:19,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:19,721 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:66, output treesize:3 [2018-04-10 14:15:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:19,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:19,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 33] total 59 [2018-04-10 14:15:19,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 14:15:19,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 14:15:19,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3201, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 14:15:19,809 INFO L87 Difference]: Start difference. First operand 281 states and 299 transitions. Second operand 59 states. [2018-04-10 14:15:22,416 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 158 DAG size of output 97 [2018-04-10 14:15:22,654 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 175 DAG size of output 104 [2018-04-10 14:15:23,534 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 226 DAG size of output 120 [2018-04-10 14:15:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:25,453 INFO L93 Difference]: Finished difference Result 360 states and 376 transitions. [2018-04-10 14:15:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 14:15:25,453 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 74 [2018-04-10 14:15:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:25,454 INFO L225 Difference]: With dead ends: 360 [2018-04-10 14:15:25,454 INFO L226 Difference]: Without dead ends: 360 [2018-04-10 14:15:25,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2583 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=943, Invalid=9157, Unknown=0, NotChecked=0, Total=10100 [2018-04-10 14:15:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-10 14:15:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 273. [2018-04-10 14:15:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-10 14:15:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 289 transitions. [2018-04-10 14:15:25,456 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 289 transitions. Word has length 74 [2018-04-10 14:15:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:25,456 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 289 transitions. [2018-04-10 14:15:25,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 14:15:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 289 transitions. [2018-04-10 14:15:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:15:25,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:25,457 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:25,457 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash -746330791, now seen corresponding path program 4 times [2018-04-10 14:15:25,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:25,457 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:25,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:25,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:15:25,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:25,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:25,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:25,889 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:25,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 14:15:26,052 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 14:15:26,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:15:26,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:26,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:15:26,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:15:26,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 14:15:26,157 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-10 14:15:26,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 14:15:26,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,169 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-10 14:15:26,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:26,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:15:26,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:15:26,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:26,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2018-04-10 14:15:26,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:26,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,290 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-10 14:15:26,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2018-04-10 14:15:26,413 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 17 treesize of output 11 [2018-04-10 14:15:26,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,421 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-10 14:15:26,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:69 [2018-04-10 14:15:26,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-10 14:15:26,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,478 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-10 14:15:26,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:86 [2018-04-10 14:15:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:15:26,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:15:26,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:26,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:26,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,576 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 88 treesize of output 92 [2018-04-10 14:15:26,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-10 14:15:26,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:26,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:26,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,602 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 96 [2018-04-10 14:15:26,612 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 52 [2018-04-10 14:15:26,613 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:15:26,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:26,659 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:116, output treesize:157 [2018-04-10 14:15:26,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,776 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 88 treesize of output 104 [2018-04-10 14:15:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:26,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,801 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 29 treesize of output 30 [2018-04-10 14:15:26,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:26,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,817 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-10 14:15:26,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:89 [2018-04-10 14:15:26,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:26,971 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 33 treesize of output 61 [2018-04-10 14:15:26,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:26,984 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-10 14:15:26,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:126, output treesize:118 [2018-04-10 14:15:27,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-04-10 14:15:27,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:15:27,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:27,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:27,102 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 107 treesize of output 114 [2018-04-10 14:15:27,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:15:27,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,122 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 99 treesize of output 106 [2018-04-10 14:15:27,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-04-10 14:15:27,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,133 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:27,167 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:145, output treesize:209 [2018-04-10 14:15:27,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 134 [2018-04-10 14:15:27,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 14:15:27,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-10 14:15:27,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:15:27,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,334 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-10 14:15:27,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:200, output treesize:168 [2018-04-10 14:15:27,456 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 36 treesize of output 34 [2018-04-10 14:15:27,457 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:27,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:15:27,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,462 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-10 14:15:27,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:27,476 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:185, output treesize:150 [2018-04-10 14:15:27,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-10 14:15:27,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-10 14:15:27,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,720 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-10 14:15:27,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:169, output treesize:154 [2018-04-10 14:15:27,777 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:27,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:27,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 90 [2018-04-10 14:15:27,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-10 14:15:27,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:15:27,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:15:27,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,799 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:27,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 13 [2018-04-10 14:15:27,799 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:27,806 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:154, output treesize:5 [2018-04-10 14:15:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:27,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:27,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 53 [2018-04-10 14:15:27,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 14:15:27,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 14:15:27,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2608, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 14:15:27,867 INFO L87 Difference]: Start difference. First operand 273 states and 289 transitions. Second operand 54 states. [2018-04-10 14:15:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:30,848 INFO L93 Difference]: Finished difference Result 346 states and 364 transitions. [2018-04-10 14:15:30,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 14:15:30,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 74 [2018-04-10 14:15:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:30,849 INFO L225 Difference]: With dead ends: 346 [2018-04-10 14:15:30,849 INFO L226 Difference]: Without dead ends: 346 [2018-04-10 14:15:30,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1117, Invalid=8585, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 14:15:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-10 14:15:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 281. [2018-04-10 14:15:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-10 14:15:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 298 transitions. [2018-04-10 14:15:30,851 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 298 transitions. Word has length 74 [2018-04-10 14:15:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:30,852 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 298 transitions. [2018-04-10 14:15:30,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 14:15:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 298 transitions. [2018-04-10 14:15:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-10 14:15:30,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:30,852 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:15:30,852 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -746330790, now seen corresponding path program 4 times [2018-04-10 14:15:30,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:30,852 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:30,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:30,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:15:30,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:30,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:31,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:31,333 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 14:15:31,492 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 14:15:31,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:15:31,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:31,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:31,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:31,565 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-10 14:15:31,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 14:15:31,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 14:15:31,609 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-10 14:15:31,610 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-10 14:15:31,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,620 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-10 14:15:31,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:31,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-04-10 14:15:31,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 73 [2018-04-10 14:15:31,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:31,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:15:31,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:31,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,736 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-10 14:15:31,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2018-04-10 14:15:31,861 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 17 treesize of output 11 [2018-04-10 14:15:31,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,869 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-10 14:15:31,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:69 [2018-04-10 14:15:31,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:31,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:31,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:31,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-10 14:15:31,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:31,929 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-10 14:15:31,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:89 [2018-04-10 14:15:31,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:31,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 74 [2018-04-10 14:15:31,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-04-10 14:15:31,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:32,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:32,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 68 [2018-04-10 14:15:32,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,044 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:32,044 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 44 [2018-04-10 14:15:32,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:32,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 63 [2018-04-10 14:15:32,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 14:15:32,058 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,089 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 2 xjuncts. [2018-04-10 14:15:32,089 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:116, output treesize:177 [2018-04-10 14:15:32,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,217 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 40 treesize of output 61 [2018-04-10 14:15:32,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:32,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,243 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 82 treesize of output 98 [2018-04-10 14:15:32,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:32,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,266 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-10 14:15:32,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:96 [2018-04-10 14:15:32,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,517 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 33 treesize of output 61 [2018-04-10 14:15:32,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 25 [2018-04-10 14:15:32,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,555 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-10 14:15:32,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:141 [2018-04-10 14:15:32,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 125 [2018-04-10 14:15:32,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:15:32,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:32,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:32,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,691 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 121 treesize of output 130 [2018-04-10 14:15:32,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,701 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-10 14:15:32,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,724 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 113 treesize of output 120 [2018-04-10 14:15:32,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-04-10 14:15:32,727 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:32,778 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:166, output treesize:261 [2018-04-10 14:15:32,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 156 [2018-04-10 14:15:32,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 14:15:32,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:32,975 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 56 treesize of output 85 [2018-04-10 14:15:32,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:15:32,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:32,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,005 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-10 14:15:33,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:233, output treesize:201 [2018-04-10 14:15:33,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-10 14:15:33,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-10 14:15:33,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,479 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-10 14:15:33,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:237, output treesize:222 [2018-04-10 14:15:33,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:33,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:33,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:33,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:33,566 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:33,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:33,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 158 [2018-04-10 14:15:33,575 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:33,578 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 52 [2018-04-10 14:15:33,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:33,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:33,606 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 76 treesize of output 80 [2018-04-10 14:15:33,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,608 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:33,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 100 [2018-04-10 14:15:33,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:33,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-04-10 14:15:33,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:33,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-04-10 14:15:33,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:33,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2018-04-10 14:15:33,678 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2018-04-10 14:15:33,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:33,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-04-10 14:15:33,736 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-10 14:15:33,736 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,746 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:33,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 14:15:33,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,757 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-10 14:15:33,757 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,764 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-04-10 14:15:33,768 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-10 14:15:33,769 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,780 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:33,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 14:15:33,780 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,790 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-10 14:15:33,790 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,797 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:33,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:33,823 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:234, output treesize:37 [2018-04-10 14:15:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:33,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:33,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 57 [2018-04-10 14:15:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 14:15:33,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 14:15:33,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3072, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 14:15:33,992 INFO L87 Difference]: Start difference. First operand 281 states and 298 transitions. Second operand 58 states. [2018-04-10 14:15:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:15:39,506 INFO L93 Difference]: Finished difference Result 378 states and 395 transitions. [2018-04-10 14:15:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 14:15:39,506 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-04-10 14:15:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:15:39,507 INFO L225 Difference]: With dead ends: 378 [2018-04-10 14:15:39,507 INFO L226 Difference]: Without dead ends: 378 [2018-04-10 14:15:39,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2570 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1013, Invalid=9485, Unknown=8, NotChecked=0, Total=10506 [2018-04-10 14:15:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-10 14:15:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 287. [2018-04-10 14:15:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-10 14:15:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 304 transitions. [2018-04-10 14:15:39,510 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 304 transitions. Word has length 74 [2018-04-10 14:15:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:15:39,510 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 304 transitions. [2018-04-10 14:15:39,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 14:15:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 304 transitions. [2018-04-10 14:15:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-10 14:15:39,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:15:39,511 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:15:39,511 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:15:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash 181605337, now seen corresponding path program 3 times [2018-04-10 14:15:39,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:15:39,511 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:15:39,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:39,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:15:39,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:15:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:15:39,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:15:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:40,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:15:40,536 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:15:40,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:15:40,624 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 14:15:40,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:15:40,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:15:40,697 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-10 14:15:40,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:15:40,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 14:15:40,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10 14:15:40,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:15:40,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-10 14:15:40,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:40,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:40,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:40,846 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 30 [2018-04-10 14:15:40,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,859 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-10 14:15:40,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:53 [2018-04-10 14:15:40,912 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-10 14:15:40,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:40,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,931 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-10 14:15:40,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:15:40,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:40,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:73 [2018-04-10 14:15:41,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-04-10 14:15:41,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:41,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,091 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 29 treesize of output 30 [2018-04-10 14:15:41,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:41,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,112 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-10 14:15:41,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:115, output treesize:99 [2018-04-10 14:15:41,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-10 14:15:41,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:15:41,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 14:15:41,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,191 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-10 14:15:41,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:89 [2018-04-10 14:15:41,282 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 17 treesize of output 11 [2018-04-10 14:15:41,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,303 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 1 case distinctions, treesize of input 32 treesize of output 41 [2018-04-10 14:15:41,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:41,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:41,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:114, output treesize:93 [2018-04-10 14:15:41,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,375 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 25 treesize of output 33 [2018-04-10 14:15:41,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,387 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-10 14:15:41,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:90 [2018-04-10 14:15:41,447 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 69 treesize of output 64 [2018-04-10 14:15:41,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:15:41,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:41,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:41,490 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 2 xjuncts. [2018-04-10 14:15:41,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:104, output treesize:227 [2018-04-10 14:15:41,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,610 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 86 treesize of output 94 [2018-04-10 14:15:41,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:41,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,632 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-10 14:15:41,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:98 [2018-04-10 14:15:41,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,796 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 1 case distinctions, treesize of input 43 treesize of output 80 [2018-04-10 14:15:41,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:15:41,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,819 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-10 14:15:41,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:134, output treesize:138 [2018-04-10 14:15:41,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:41,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 106 [2018-04-10 14:15:41,991 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 34 treesize of output 17 [2018-04-10 14:15:41,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:41,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,016 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-10 14:15:42,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:156, output treesize:143 [2018-04-10 14:15:42,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:42,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:42,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:42,105 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-10 14:15:42,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:42,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:157, output treesize:150 [2018-04-10 14:15:42,209 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 128 treesize of output 114 [2018-04-10 14:15:42,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:15:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:42,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:15:42,280 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-10 14:15:42,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:15:42,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:42,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:172, output treesize:280 [2018-04-10 14:15:42,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:42,516 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 154 [2018-04-10 14:15:42,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 134 [2018-04-10 14:15:42,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:42,864 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 132 treesize of output 131 [2018-04-10 14:15:42,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:42,939 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 123 [2018-04-10 14:15:42,940 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:43,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:15:43,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 139 [2018-04-10 14:15:43,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:43,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:43,092 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 118 treesize of output 123 [2018-04-10 14:15:43,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:43,094 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,110 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 152 [2018-04-10 14:15:43,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:15:43,116 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,131 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 14:15:43,196 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:175, output treesize:464 [2018-04-10 14:15:43,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 158 [2018-04-10 14:15:43,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 125 [2018-04-10 14:15:43,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:43,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 111 [2018-04-10 14:15:43,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:43,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 114 [2018-04-10 14:15:43,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:43,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 100 [2018-04-10 14:15:43,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 133 [2018-04-10 14:15:43,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:43,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 122 [2018-04-10 14:15:43,928 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 108 [2018-04-10 14:15:44,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:44,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2018-04-10 14:15:44,118 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:44,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 116 [2018-04-10 14:15:44,212 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:44,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 102 [2018-04-10 14:15:44,306 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 100 [2018-04-10 14:15:44,397 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-04-10 14:15:44,480 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:44,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-10 14:15:44,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-04-10 14:15:44,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:15:44,682 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,698 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-10 14:15:44,698 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,717 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2018-04-10 14:15:44,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:15:44,721 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:15:44,739 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,753 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2018-04-10 14:15:44,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:15:44,757 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,773 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-10 14:15:44,773 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,786 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-04-10 14:15:44,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:15:44,790 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,808 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-10 14:15:44,808 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,823 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 127 [2018-04-10 14:15:44,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-04-10 14:15:44,929 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,946 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 51 treesize of output 36 [2018-04-10 14:15:44,946 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:44,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2018-04-10 14:15:44,962 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:44,976 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:15:45,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2018-04-10 14:15:45,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:15:45,075 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:15:45,088 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,099 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 24 dim-0 vars, and 5 xjuncts. [2018-04-10 14:15:45,179 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:425, output treesize:367 [2018-04-10 14:15:45,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2018-04-10 14:15:45,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,360 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 94 treesize of output 85 [2018-04-10 14:15:45,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:45,422 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 121 [2018-04-10 14:15:45,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:15:45,426 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 95 treesize of output 86 [2018-04-10 14:15:45,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:45,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 84 [2018-04-10 14:15:45,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:45,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-04-10 14:15:45,673 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:45,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:15:45,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:45,884 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 123 [2018-04-10 14:15:45,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:45,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 104 [2018-04-10 14:15:45,893 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:46,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:46,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 84 [2018-04-10 14:15:46,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-10 14:15:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-04-10 14:15:46,196 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:46,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:46,279 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 64 treesize of output 83 [2018-04-10 14:15:46,279 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-04-10 14:15:46,361 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 14:15:46,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 38 dim-0 vars, and 7 xjuncts. [2018-04-10 14:15:46,485 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 15 variables, input treesize:189, output treesize:443 [2018-04-10 14:15:46,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:46,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-04-10 14:15:46,831 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-04-10 14:15:46,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:15:46,839 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-10 14:15:46,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:46,845 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-10 14:15:46,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:46,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:46,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 85 [2018-04-10 14:15:46,894 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 77 treesize of output 70 [2018-04-10 14:15:46,894 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:46,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-10 14:15:46,930 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:46,983 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 58 treesize of output 40 [2018-04-10 14:15:46,984 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,010 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 62 treesize of output 55 [2018-04-10 14:15:47,011 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,036 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 40 treesize of output 33 [2018-04-10 14:15:47,036 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 114 [2018-04-10 14:15:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,128 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 121 [2018-04-10 14:15:47,130 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:15:47,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-04-10 14:15:47,359 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-04-10 14:15:47,532 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:47,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-10 14:15:47,702 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:47,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-04-10 14:15:47,883 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,047 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 78 treesize of output 73 [2018-04-10 14:15:48,047 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-04-10 14:15:48,213 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2018-04-10 14:15:48,356 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:48,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-04-10 14:15:48,503 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,623 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 86 treesize of output 81 [2018-04-10 14:15:48,624 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,728 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 81 treesize of output 63 [2018-04-10 14:15:48,728 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:48,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:48,839 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 86 treesize of output 80 [2018-04-10 14:15:48,839 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:48,957 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 63 treesize of output 56 [2018-04-10 14:15:48,958 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,076 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 80 treesize of output 75 [2018-04-10 14:15:49,077 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-10 14:15:49,200 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,343 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 71 treesize of output 64 [2018-04-10 14:15:49,343 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-04-10 14:15:49,414 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,491 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 75 treesize of output 70 [2018-04-10 14:15:49,491 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:49,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:15:49,559 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 70 treesize of output 64 [2018-04-10 14:15:49,559 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,628 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 60 treesize of output 53 [2018-04-10 14:15:49,629 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:49,749 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 64 treesize of output 53 [2018-04-10 14:15:49,750 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 14:15:50,134 INFO L267 ElimStorePlain]: Start of recursive call 12: 29 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 14:15:50,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:15:50,201 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 22 variables, input treesize:211, output treesize:34 [2018-04-10 14:15:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:15:50,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:15:50,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 64 [2018-04-10 14:15:50,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 14:15:50,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 14:15:50,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3746, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 14:15:50,310 INFO L87 Difference]: Start difference. First operand 287 states and 304 transitions. Second operand 64 states. [2018-04-10 14:15:52,309 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 145 DAG size of output 94 [2018-04-10 14:15:52,505 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 133 DAG size of output 92 [2018-04-10 14:15:52,836 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 162 DAG size of output 120 [2018-04-10 14:15:54,879 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 163 DAG size of output 142 [2018-04-10 14:15:55,283 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 158 DAG size of output 137 [2018-04-10 14:15:55,502 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 148 DAG size of output 121 [2018-04-10 14:15:59,629 WARN L151 SmtUtils]: Spent 3982ms on a formula simplification. DAG size of input: 224 DAG size of output 201 [2018-04-10 14:15:59,805 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 168 DAG size of output 113 [2018-04-10 14:16:02,674 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 171 DAG size of output 117 [2018-04-10 14:16:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:02,866 INFO L93 Difference]: Finished difference Result 309 states and 314 transitions. [2018-04-10 14:16:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 14:16:02,867 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 79 [2018-04-10 14:16:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:02,867 INFO L225 Difference]: With dead ends: 309 [2018-04-10 14:16:02,867 INFO L226 Difference]: Without dead ends: 309 [2018-04-10 14:16:02,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3845 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1848, Invalid=12432, Unknown=0, NotChecked=0, Total=14280 [2018-04-10 14:16:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-10 14:16:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 266. [2018-04-10 14:16:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 14:16:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 279 transitions. [2018-04-10 14:16:02,869 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 279 transitions. Word has length 79 [2018-04-10 14:16:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:02,869 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 279 transitions. [2018-04-10 14:16:02,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 14:16:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 279 transitions. [2018-04-10 14:16:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-10 14:16:02,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:02,870 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:02,870 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2058874779, now seen corresponding path program 5 times [2018-04-10 14:16:02,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:02,870 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:02,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:02,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:16:02,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:02,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:16:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:16:03,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:03,461 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:16:03,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 14:16:03,501 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-10 14:16:03,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:16:03,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:03,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:16:03,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-10 14:16:03,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, 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-10 14:16:03,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:16:03,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,559 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-10 14:16:03,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 14:16:03,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2018-04-10 14:16:03,632 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 52 treesize of output 57 [2018-04-10 14:16:03,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-04-10 14:16:03,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,665 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 29 treesize of output 45 [2018-04-10 14:16:03,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:16:03,668 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 27 treesize of output 35 [2018-04-10 14:16:03,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-10 14:16:03,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,691 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-10 14:16:03,691 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-10 14:16:03,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-04-10 14:16:03,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-10 14:16:03,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,740 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 19 treesize of output 12 [2018-04-10 14:16:03,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-04-10 14:16:03,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,755 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-10 14:16:03,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:41 [2018-04-10 14:16:03,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-04-10 14:16:03,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,820 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-10 14:16:03,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:37 [2018-04-10 14:16:03,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:03,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:03,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:03,855 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 38 [2018-04-10 14:16:03,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:03,864 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-10 14:16:03,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:54 [2018-04-10 14:16:03,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:03,920 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 4 case distinctions, treesize of input 41 treesize of output 52 [2018-04-10 14:16:03,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2018-04-10 14:16:03,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:03,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:16:03,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-04-10 14:16:03,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:03,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 14:16:03,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 14:16:03,995 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:205 [2018-04-10 14:16:04,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-04-10 14:16:04,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:04,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 82 [2018-04-10 14:16:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:04,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:04,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:112 [2018-04-10 14:16:04,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,375 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 102 treesize of output 134 [2018-04-10 14:16:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,415 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 57 treesize of output 69 [2018-04-10 14:16:04,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,442 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 2 xjuncts. [2018-04-10 14:16:04,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:184 [2018-04-10 14:16:04,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-04-10 14:16:04,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:16:04,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:04,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2018-04-10 14:16:04,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:16:04,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:04,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:04,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 14:16:04,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:216, output treesize:353 [2018-04-10 14:16:04,843 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 79 treesize of output 83 [2018-04-10 14:16:04,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:04,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:04,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 123 [2018-04-10 14:16:04,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:04,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:04,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:04,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:164 [2018-04-10 14:16:05,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,157 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 110 treesize of output 134 [2018-04-10 14:16:05,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:05,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 247 [2018-04-10 14:16:05,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:05,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:05,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:286, output treesize:338 [2018-04-10 14:16:05,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,341 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 220 treesize of output 177 [2018-04-10 14:16:05,348 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 2 case distinctions, treesize of input 24 treesize of output 31 [2018-04-10 14:16:05,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:05,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:05,459 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 139 treesize of output 125 [2018-04-10 14:16:05,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:16:05,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:05,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:05,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-10 14:16:05,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:360, output treesize:597 [2018-04-10 14:16:05,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 131 [2018-04-10 14:16:05,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 14:16:05,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:05,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:05,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:05,906 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 2 case distinctions, treesize of input 278 treesize of output 167 [2018-04-10 14:16:05,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-10 14:16:05,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:05,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:05,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:05,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:468, output treesize:432 [2018-04-10 14:16:06,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 188 [2018-04-10 14:16:06,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-10 14:16:06,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 273 [2018-04-10 14:16:06,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-10 14:16:06,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:06,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:470, output treesize:440 [2018-04-10 14:16:06,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:06,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 262 treesize of output 135 [2018-04-10 14:16:06,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2018-04-10 14:16:06,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:06,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-04-10 14:16:06,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 69 [2018-04-10 14:16:06,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:06,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 108 [2018-04-10 14:16:06,760 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:06,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2018-04-10 14:16:06,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:06,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-04-10 14:16:06,962 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:07,063 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 110 treesize of output 101 [2018-04-10 14:16:07,063 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:07,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-04-10 14:16:07,173 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:07,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-04-10 14:16:07,261 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:07,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2018-04-10 14:16:07,263 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:07,351 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 89 treesize of output 80 [2018-04-10 14:16:07,351 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:07,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2018-04-10 14:16:07,436 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:07,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2018-04-10 14:16:07,516 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:07,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 108 treesize of output 109 [2018-04-10 14:16:07,604 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:07,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-04-10 14:16:07,697 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:07,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-04-10 14:16:07,780 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:07,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2018-04-10 14:16:07,860 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:07,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-04-10 14:16:07,937 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:08,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 16 dim-1 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-04-10 14:16:08,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 93 [2018-04-10 14:16:08,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:16:08,114 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:08,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-10 14:16:08,125 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:08,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-04-10 14:16:08,135 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:08,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-10 14:16:08,144 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:08,152 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:08,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 6 xjuncts. [2018-04-10 14:16:08,240 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 10 variables, input treesize:440, output treesize:339 [2018-04-10 14:16:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:16:08,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:08,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2018-04-10 14:16:08,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 14:16:08,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 14:16:08,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=3700, Unknown=13, NotChecked=0, Total=4160 [2018-04-10 14:16:08,504 INFO L87 Difference]: Start difference. First operand 266 states and 279 transitions. Second operand 65 states. [2018-04-10 14:16:13,487 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 101 DAG size of output 88 [2018-04-10 14:16:13,735 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 148 DAG size of output 134 [2018-04-10 14:16:14,062 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 127 DAG size of output 115 [2018-04-10 14:16:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:15,617 INFO L93 Difference]: Finished difference Result 465 states and 483 transitions. [2018-04-10 14:16:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-10 14:16:15,618 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 79 [2018-04-10 14:16:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:15,618 INFO L225 Difference]: With dead ends: 465 [2018-04-10 14:16:15,619 INFO L226 Difference]: Without dead ends: 465 [2018-04-10 14:16:15,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6329 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2648, Invalid=16221, Unknown=37, NotChecked=0, Total=18906 [2018-04-10 14:16:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-04-10 14:16:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 317. [2018-04-10 14:16:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-04-10 14:16:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 333 transitions. [2018-04-10 14:16:15,621 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 333 transitions. Word has length 79 [2018-04-10 14:16:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:15,621 INFO L459 AbstractCegarLoop]: Abstraction has 317 states and 333 transitions. [2018-04-10 14:16:15,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 14:16:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 333 transitions. [2018-04-10 14:16:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-10 14:16:15,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:15,622 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:15,622 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2058874780, now seen corresponding path program 5 times [2018-04-10 14:16:15,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:15,622 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:15,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:15,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:16:15,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:15,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:16:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:16:16,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:16,665 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:16:16,670 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 14:16:16,711 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-10 14:16:16,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:16:16,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:16,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 14:16:16,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 14:16:16,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-10 14:16:16,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:16,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:16,766 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-10 14:16:16,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:16:16,791 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-10 14:16:16,792 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-10 14:16:16,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,801 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-10 14:16:16,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:16:16,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:16:16,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 14:16:16,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:16,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 14:16:16,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:16,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:16,939 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-10 14:16:16,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-10 14:16:17,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,098 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 42 [2018-04-10 14:16:17,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,116 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-10 14:16:17,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,132 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-10 14:16:17,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:93 [2018-04-10 14:16:17,189 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 39 treesize of output 49 [2018-04-10 14:16:17,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-10 14:16:17,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,237 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 92 treesize of output 91 [2018-04-10 14:16:17,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-10 14:16:17,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,261 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 88 treesize of output 93 [2018-04-10 14:16:17,263 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:16:17,263 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 22 treesize of output 21 [2018-04-10 14:16:17,263 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:17,307 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:115, output treesize:221 [2018-04-10 14:16:17,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 87 [2018-04-10 14:16:17,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:17,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,440 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 106 treesize of output 114 [2018-04-10 14:16:17,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:17,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,466 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-10 14:16:17,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:141, output treesize:117 [2018-04-10 14:16:17,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2018-04-10 14:16:17,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,647 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 43 treesize of output 115 [2018-04-10 14:16:17,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,671 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-10 14:16:17,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:191, output treesize:212 [2018-04-10 14:16:17,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 157 [2018-04-10 14:16:17,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:16:17,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,816 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 199 treesize of output 177 [2018-04-10 14:16:17,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 14:16:17,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:17,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:17,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 175 [2018-04-10 14:16:17,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-10 14:16:17,856 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,873 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:17,929 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:234, output treesize:391 [2018-04-10 14:16:18,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,076 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 212 treesize of output 211 [2018-04-10 14:16:18,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:18,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 135 [2018-04-10 14:16:18,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:18,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,154 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-10 14:16:18,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:224, output treesize:208 [2018-04-10 14:16:18,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,340 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 173 [2018-04-10 14:16:18,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,376 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 58 treesize of output 169 [2018-04-10 14:16:18,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,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-10 14:16:18,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:319, output treesize:309 [2018-04-10 14:16:18,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 217 [2018-04-10 14:16:18,517 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 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-10 14:16:18,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:18,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:18,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 253 [2018-04-10 14:16:18,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 14:16:18,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 269 [2018-04-10 14:16:18,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:18,670 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-10 14:16:18,670 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:18,775 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:331, output treesize:554 [2018-04-10 14:16:18,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 443 treesize of output 228 [2018-04-10 14:16:18,947 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 46 treesize of output 45 [2018-04-10 14:16:18,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:18,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 409 treesize of output 389 [2018-04-10 14:16:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 14:16:18,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,046 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-10 14:16:19,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:450, output treesize:402 [2018-04-10 14:16:19,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-10 14:16:19,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-10 14:16:19,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,350 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-10 14:16:19,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:421, output treesize:406 [2018-04-10 14:16:19,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 165 [2018-04-10 14:16:19,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 28 [2018-04-10 14:16:19,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:19,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-04-10 14:16:19,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:19,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 14:16:19,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-04-10 14:16:19,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:19,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 22 [2018-04-10 14:16:19,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:19,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 14:16:19,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:16:19,534 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,538 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-10 14:16:19,538 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,539 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:19,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:16:19,551 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:416, output treesize:48 [2018-04-10 14:16:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. Received shutdown request... [2018-04-10 14:16:19,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:19,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 67 [2018-04-10 14:16:19,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 14:16:19,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 14:16:19,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4074, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 14:16:19,722 INFO L87 Difference]: Start difference. First operand 317 states and 333 transitions. Second operand 68 states. [2018-04-10 14:16:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 14:16:19,722 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:16:19,726 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:16:19,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:16:19 BoogieIcfgContainer [2018-04-10 14:16:19,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:16:19,727 INFO L168 Benchmark]: Toolchain (without parser) took 184291.43 ms. Allocated memory was 402.7 MB in the beginning and 707.8 MB in the end (delta: 305.1 MB). Free memory was 340.3 MB in the beginning and 439.0 MB in the end (delta: -98.7 MB). Peak memory consumption was 206.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:16:19,728 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 365.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:16:19,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.83 ms. Allocated memory is still 402.7 MB. Free memory was 339.0 MB in the beginning and 312.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:16:19,728 INFO L168 Benchmark]: Boogie Preprocessor took 59.01 ms. Allocated memory is still 402.7 MB. Free memory was 312.6 MB in the beginning and 309.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:16:19,728 INFO L168 Benchmark]: RCFGBuilder took 486.38 ms. Allocated memory was 402.7 MB in the beginning and 614.5 MB in the end (delta: 211.8 MB). Free memory was 308.6 MB in the beginning and 535.2 MB in the end (delta: -226.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:16:19,729 INFO L168 Benchmark]: TraceAbstraction took 183474.32 ms. Allocated memory was 614.5 MB in the beginning and 707.8 MB in the end (delta: 93.3 MB). Free memory was 535.2 MB in the beginning and 439.0 MB in the end (delta: 96.1 MB). Peak memory consumption was 189.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:16:19,730 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.15 ms. Allocated memory is still 402.7 MB. Free memory is still 365.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 268.83 ms. Allocated memory is still 402.7 MB. Free memory was 339.0 MB in the beginning and 312.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 59.01 ms. Allocated memory is still 402.7 MB. Free memory was 312.6 MB in the beginning and 309.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 486.38 ms. Allocated memory was 402.7 MB in the beginning and 614.5 MB in the end (delta: 211.8 MB). Free memory was 308.6 MB in the beginning and 535.2 MB in the end (delta: -226.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183474.32 ms. Allocated memory was 614.5 MB in the beginning and 707.8 MB in the end (delta: 93.3 MB). Free memory was 535.2 MB in the beginning and 439.0 MB in the end (delta: 96.1 MB). Peak memory consumption was 189.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (317states) and interpolant automaton (currently 2 states, 68 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 137 locations, 55 error locations. TIMEOUT Result, 183.4s OverallTime, 54 OverallIterations, 4 TraceHistogramMax, 109.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3843 SDtfs, 33883 SDslu, 49745 SDs, 0 SdLazy, 68996 SolverSat, 5815 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 33.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4282 GetRequests, 1604 SyntacticMatches, 108 SemanticMatches, 2570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54523 ImplicationChecksByTransitivity, 107.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 53 MinimizatonAttempts, 3425 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 70.1s InterpolantComputationTime, 4883 NumberOfCodeBlocks, 4883 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 4795 ConstructedInterpolants, 1012 QuantifiedInterpolants, 13137452 SizeOfPredicates, 703 NumberOfNonLiveVariables, 8395 ConjunctsInSsa, 1849 ConjunctsInUnsatCore, 88 InterpolantComputations, 20 PerfectInterpolantSequences, 55/994 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-16-19-734.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-16-19-734.csv Completed graceful shutdown